Maze Generation Algorithm
Select Algorithm
Recursive Backtracking
Kruskal
Generate Maze
Shortest Path Algorithm
Select Algorithm
Breadth-first Search
Dijkstra
A* (Euclidean)
A* (Manhattan)
Visualize
Others
Clear Wall
Clear Result
Clear All
Empty
Wall
Visited
Shortest Path
Graph is
unweighted
, so BFS and Dijkstra will give similar result
No additional library used (except jquery)