Pathfinding Visualizer (A*, BFS, DFS)
Navigate through mazes using classic graph theory algorithms.
🚧 Coming Soon 🚧
The Pathfinding works are currently under construction.
In the meantime, check out our sorting algorithms.
Algorithm Overview
- Dijkstra: The father of pathfinding. Guarantees shortest path.
- A* (A-Star): Uses heuristics to find the path much faster than Dijkstra. Used in games.
- BFS (Breadth-First Search): Explores equally in all directions. Unweighted shortest path.
- DFS (Depth-First Search): Explores as deep as possible. Not guaranteed shortest path.
Graph Theory in Action
From GPS navigation to network routing, Pathfinding Algorithms run the world. This visualizer (coming soon) will let you draw walls and watch the "search frontier" expand until it hits the target.