All examples By author By category About

uredkar

Analyzing Spanning Trees

These histograms show great-grandchildren counts for spanning trees generated by various algorithms. Randomized depth-first traversal has a strong tendency to generate long non-branching passages, where most nodes only have one child.

forked from mbostock's block: Analyzing Spanning Trees