[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
bug#52753: 29.0.50; Printing long list-like structures fails
|
From: |
Mattias Engdegård |
|
Subject: |
bug#52753: 29.0.50; Printing long list-like structures fails |
|
Date: |
Sat, 25 Dec 2021 12:15:27 +0100 |
24 dec. 2021 kl. 17:54 skrev Mattias Engdegård <mattiase@acm.org>:
> We could perhaps use the old flip-the-pointers trick to do the counting in
> O(1) space (first demonstrated by Knuth, I believe). It works on general
> graphs but can be a bit slow.
No idea why I wrote this nonsense; trees can be traversed in constant space but
not general graphs. Sorry about that!