maze-solver

Web version of my graph-algorithms-visualization project (https://github.com/dusanerdeljan/graph-algorithms-visualization) built with React.

Available at: https://dusanerdeljan.github.io/maze-solver/

Supported algorithms

Maze generation algorithms

Maze generation algorithms are based on finding the minimum spanning tree of a grid-like graph with random edge weights. Supported maze generation algorithms:

• Kruskal
• Prim-Jarnik
• Boruvka

Maze solving algorithms

Currently supported maze solving algorithms are the most popular pathfinding algorithms:

• Depth-first search (DFS)
• Breadth-first search (BFS)
• Dijkstra
• A* with Manhattan distance as heuristic function
• Bidirectional search

Controls

Click on the board to place the start vertex. Shift + Click on the board to place the end vertex.

License

This program is free. You can redistribute it and/or change it under the terms of GNU General Public License version 3.0 (GPLv3). You can find a copy of the license in the repository.