Pathfinding Visualizer

Watch A*, Dijkstra, breadth-first, and depth-first search explore a grid. Draw walls, drag the endpoints, generate a maze, then run it.

Speed
Start End Wall Visited Path
Algorithm: A* Visited: 0 Path length: 0

Click/drag empty cells to draw walls · drag the green/pink squares to move start & end · BFS, Dijkstra and A* find the shortest path; DFS just finds a path.