Wilson’s Algorithm

Wilson’s algorithm uses loop-erased random walks to generate a uniform spanning tree — an unbiased sample of all possible spanning trees. Most other maze generation algorithms, such as Prim’s, random traversal and randomized depth-first traversal, do not have this beautiful property.

Click here to visit link (bl.ocks.org)


Commenting will be coming soon. In the meantime, feel free to create a discussion topic on the forums.