class Theseus::Algorithms::Kruskal
Kruskal's algorithm is a means of finding a minimum spanning tree for a weighted graph. By changing how edges are selected, it becomes suitable for use as a maze generator.
The mazes it generates tend to have a lot of short cul-de-sacs, which on the one hand makes the maze look “spiky”, but on the other hand can potentially make the maze harder to solve.
This implementation of Kruskal's algorithm does not support weave mazes.