Maze Generation

This is an interactive example of different maze generation algorithms in JavaScript.

They are based on graph theory, more specifically algorithms that generate minimum spanning trees and are adapted to generate mazes, by considering the graph as a square grid of points connected by edges of random weights.

So far, the algorithms at display are:

• Prim–Jarník algorithm
• Kruskal's algorithm
• Depth-first search

You can view them online at https://tuzepoito.github.io/maze-generation/ .