Hacker News new | past | comments | ask | show | jobs | submit login

Why is it useful, today, to represent graphs using Knuth trees? Especially when not all graphs are thus representable?



I think this is what he called threaded trees. Just space efficient.

HTML dom has the necessary links. Let's you do dfs without a stack.


I guess you can always assign an orientation to an arbitrary graph so that it becomes representable? Some implementations of sparse matrices look essentially the same as the knuth transform.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: