Interactive Pathfinding Visualizer built with React + Vite to demonstrate BFS, DFS, Dijkstra, and A* algorithms with live grid animations. This tool demonstrates how different algorithms explore and find the shortest path step by step with animations.
- 🎯 Visualizes multiple algorithms (Dijkstra, A*, BFS, DFS).
- 🖱️ Interactive grid (add/remove walls and weights).
- 🎥 Step-by-step algorithm animations.
- 🔄 Reset & Clear options to try again.
- ⚡ Built with React + Vite for blazing-fast performance.
- React 18
- Vite
- JavaScript (ES6+)
- CSS / TailwindCSS
- Left-click → Add walls or weights
- Right-click → Remove walls
- Select Algorithm → Choose between Dijkstra, A*, BFS, DFS
- Start Button → Watch the visualization in action
- Reset Button → Clear the grid and try again


- Dijkstra’s Algorithm – Guarantees shortest path
- A* Search – Faster with heuristics
- BFS – Explores layer by layer
- DFS – Explores depth-first