Maze Construction Algorithm
While edges remain in E
Remove a random edge e = (u, v) from E
If u and v have not yet been connected
add e to E?
mark u and v as connected
Mysterious note:
We’ll see this algorithm again!
Previous slide
Next slide
Back to first slide
View graphic version