This project helps in visualization of 3 graph algorithms. Two of which are graph traversal- BFS and DFS and other one is path finding algorithm - A star.
The grid can be assumed as a node having edges to top, left, bottom and right node.
A custom grid can be generated by putting values into the input box.
BFS and DFS can be started by clicking on any of the box of the grid
For Path Finding first selected box will be start position and second selected box will be final position, and any number of boxes can be made as wall after that.
Algorithm start by clicking on start button, and displays the result for 5 seconds after reaching to target node from start node.
- 🔭 View this project here Visual Graph