Pathfinding Visualizer

Visualize how pathfinding algorithms explore and find the shortest path

Drag to move start
Drag to move end
Click/drag to add walls
Nodes Visited 0
Path Length 0
Time 0ms

Dijkstra's Algorithm

Guarantees shortest path

Explores nodes in order of distance from start. Always finds the shortest path but explores many nodes.