Welcome to the Path Finding Algorithm Visualizer Project!
This project was created to help visualize shortest-path algorithms, enabling users to find the shortest distance between any two points. This concept is highly practical for applications such as building rovers and vehicles that traverse long distances efficiently using basic algorithms.
In this Project, the following two shortest-path finding algorithms are used:-
Dijkstra's Algorithm
Breadth First Search Algorithm
You can select the desired Algorithm from the Algorithms Tab, then choose the speed of the animation, and click the Start Button to begin visualizing the process.
If you wish to reuse the table, simply click on the Clear Board button on the NavBar, which will remove all the walls and animated cells.
A flex-box at the bottom-right corner provides information about the time taken and the length of the shortest path traversed in units by the chosen algorithm.
Future enhancements include adding new algorithms such as A* and Jump Point Search after further study, and improving the website front-end and enhancing the styling.
Well wishes and happy browsing! :)
- Vinay