Using Wilson's Algorithm to Generate Uniform Spanning Trees

Last modified: June 11, 2008

Here is an applet for generating a uniform spanning tree of an NxN integer lattice. This is a work in progress, but seems to perform reasonably well. It will continue to be updated as improvements are made.

This applet was written by Kevin Petrychyn of the University of Regina.


Michael's Home Page * U of R Math & Stats Department
June 27, 2008