Kruskal's Generator - Generate a maze using a kruskal's strategy.
Kruskal's Maze Generator is a randomized version of Kruskal’s algorithm: a method for producing a minimal spanning tree for a weighted graph.
Kruskal's is interesting because it doesn't "grow" the Maze like a tree, but rather carves passage segments all over the Maze at random, making it very fun to watch. Still, it results in a perfect Maze in the end.
The counterpart is to require storage proportional to the size of the Maze, along with the ability to enumerate each edge between cells in random order (Using here a set of edges and taking them randomly).
|width||desired width for the maze. |
|height||desired height for the maze. |
|seed||number used to initiate the random generator.|
- Operator() returns Maze Grid pointer to be owned, nullptr if construction failed.
Definition at line 50 of file kruskals_generator.hxx.