A web application to visualize various pathfinding algorithms on a Grid
Clone the repository using git clone https://github.com/ValakPalak/Path-Visualizer.git
Run npm install
Run npm start.
Open http://localhost:3000 to view it in the browser.
You can move the start and end node to which ever cell you want by dragging and dropping
Firstly, make sure you the the rightmost yellow button as Toggle (Node Type=Wall) You can add walls to which ever cells you want by clicking the mouse and dragging it and the same goes for removing them You can also toggle between wall cell and normal cell
Firstly, make sure you the the rightmost yellow button as Toggle (Node Type=Weighted(6)) You can add weighted node to which ever cells you want by clicking the mouse and dragging it and the same goes for removing them You can also toggle between wall cell and normal cell
The shortest path is calcuted on itself on moving the start or end node without having to press the calculate shortest path button.
Visualize the generated path by clicking the Visualize Path Button
Clears the grid and removes all the weighted node and walls
Clears the visualization of the algorithm and make every visited node and shortest path node as unvisited node.
For example these are the visualized paths for the A-Star and Dijkstra Algorithm
After visualization you can reposition start and end node as you want and add and delete walls as you wish and visualize using any algorithm again without reloading the webpage
- Himanshu Chaudhary
- Palak Kothari