This algorithm is a way to generate uniform spanning trees (UST)
- Choose any vertex at random and add it to the UST.
- Select any vertex that is not already in the UST and perform a random walk until you encounter a vertex that is in the UST.
- Add the vertices and edges touched in the random walk to the UST after removing cycles.
- Repeat 2 and 3 until all vertices have been added to the UST.