4 ms·
Why is it useful, today, to represent graphs using Knuth trees? Especially when not all graphs are thus representable?
by einpoklum 6y ago
Why is it useful, today, to represent graphs using Knuth trees? Especially when not all graphs are thus representable?
- taeric 6y agoI 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.
- enriquto 6y agoI 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.