The project is developed to help visualize and learn the Breadth First Search algorithm in finding the shortest path between source and destination with obstacles.
Also the code is written in a simple way to help interested folks, build the similar projects.
Link: https://sadanandpai.github.io/shortest-path-finder/dist/
Oldest comments (2)
Nicely done. Enjoyed the visualization.
Best technology to do these kind of things is to use canvas!