[Date Index] [Thread Index] [Author Index]
Combinatorics -- Random spanning trees.
I wondered if anyone had implemented Wilson's algorithm for generating random spanning trees of undirected graphs. If so, I'd very much like to see how it was done. It's easy enough to use Combinatorica to assign random weightings to the edges of the graph and then find a MinimalSpanningTree, but I think that the other approach would be much faster. ------------- Mark R. Diamond