Note: This is the public repository where all my finished work from my private repository was moved to so that some source code for key implementations can be hidden to prevent piracy. Anyone who wants access to this source code please email me at ben.gavrilov@mail.utoronto.ca
Check out my pathfinding visualizer: https://bengavrilov.github.io/Path-Finding-Visualizer/
This pathfinding visualizer shows many common pathfinding algorithms used in the tech industry in action! There is a tutorial upon entering the application that shows users how to maneuver the app. I hope you enjoy using it just as much as I do. Here is the link: https://bengavrilov.github.io/Path-Finding-Visualizer/
Dijkstra's Algorithm (weighted): the father of pathfinding algorithms; guarantees the shortest path.
A star Search (weighted): uses heuristics to guarantee the shortest path much faster than Dijkstra's algorithm. One major drawback is its space complexity.
Breadth-first Search (unweighted): fundamental algorithm; guarantees the shortest path.
Depth-first Search (unweighted): not ideal for pathfinding; does not guarantee the shortest path.
Visualizer: On/Off
Speed: Slow/Moderate/Fast
Insert/Delete Checkpoint
Mazes: Maze 1/Maze 2/ Random Maze
Front end hosted on netlify.