Each tree is selected uniformly amoug the HUGE set of possible spanning trees of this graph.
The color patterns in this algorithm vs. Prim algorithm are very different. Unlike Prim algorithm, this pattern is random and has a fractal structure.
Is there a good reason a programmer might need each UST to be equally likely?
Each tree is selected uniformly amoug the HUGE set of possible spanning trees of this graph.
The color patterns in this algorithm vs. Prim algorithm are very different. Unlike Prim algorithm, this pattern is random and has a fractal structure.
Is there a good reason a programmer might need each UST to be equally likely?