Great way to visualise graph algorithms such as Maze Generator and Shortest Path in 2D grid. Try to play with it here.
- Recursive Backtracking
- Kruskal
- Breadth-first Search
- Dijkstra
- A* (Euclidean)
- A* (Manhattan)
- Graph is unweighted, BFS and Dijkstra will give similar result
- I don't use any library (except jquery) to create this website
All code provided are under the MIT License.
Copyright © 2021 Philip Andreas