👋 Welcome to Pathfinding Visualizer!
This visualizer helps you understand how pathfinding algorithms work by showing their step-by-step
exploration on a grid.
🚀 How to Use:
- 👆 Click and drag to create walls
- ↔️ Drag the Start (➤) or Target (⍟) nodes
- 💣 Click "Add Bomb" to change the path
- ⚡ Select an algorithm and click Visualize
- 🧱 Use "Generate Maze" to auto-create obstacles
🧠 Algorithms Explained:
- BFS: Explores level-by-level. Finds shortest path (unweighted).
- DFS: Explores deep paths first. Not guaranteed to be shortest.
- Dijkstra: Guarantees shortest path (weighted).
- A*: Smartest — uses heuristics to find fastest path.