3 ms·
this is known as a uniform spanning tree https://en.wikipedia.org/wiki/Spanning_tree https://en.wikipedia.org/wiki/Spanning_tree these can be sampled using Wil
by mrcactu5 11y ago
this is known as a uniform spanning tree https://en.wikipedia.org/wiki/Spanning_tree https://en.wikipedia.org/wiki/Spanning_tree
these can be sampled using Wilson's algorithm for Loop-Erased Random Walks https://en.wikipedia.org/wiki/Loop-erased_random_walk#The_uniform_spanning_tree https://en.wikipedia.org/wiki/Loop-erased_random_walk#The_un...
Here is a nice visualization of Wilson's algorithm using d3.js by Michael Bostock (NY Times) http://bl.ocks.org/mbostock/11357811 http://bl.ocks.org/mbostock/11357811
- 9ac345a5509a 11y agoThe number of such mazes is also on OEIS under A007341: http://oeis.org/A007341 http://oeis.org/A007341