This is a JavaScript implementation of various maze-generating algorithms.
These algorithms are actually derived from graph algorithms to generate
minimum spanning trees, adapted to maze
generation by considering the graph as a grid of points, a path between two points of the grid as a graph edge, and
a wall as the absence of an edge between two nodes.
You may choose between three algorithms:
Prim–Jarník algorithm,
Kruskal's algorithm,
and depth-first search.