What is this?
A web app that utilizes the Breadth-first search algorithm to find the shortest path between two vertices. Developed using React.js framework.
You can see it here.
This project is incomplete: More changes will be made later.
Enter a valid matrix in the matrix field, and specify source and destination. Make sure that both source and destination are valid:
- The coordination of both source and destination is not an obstacle.
- Source and destination must be reachable.
Afterward, click the button
Perform BFS; it will show you the shortest path between these two. The coordinates highlighted in yellow are the shortest path vertex.
Issues & Improvements
If you find any issues or ideas for improvement, feel free to submit them! Any helps would be greatly appreciated!