Draw Mode
Grid Size
Animation Speed
Slow30msFast
Legend
Start node
End node
Wall / obstacle
Explored node
Shortest path
Weighted (×5)
Keyboard
Enter Run
R Reset
C Clear M Maze
1-4 Algorithm
C Clear M Maze
1-4 Algorithm
Click to draw walls — press RUN to visualize
Exploring
0%
Live Stats
Nodes Visited—
Path Length —
Path Cost —
Exec Time —
Efficiency —
Algorithm
Breadth-First Search
Shortest Path ✓Unweighted
Explores all neighbors level by level. Guarantees the shortest path on unweighted grids.
O(V+E) time · O(V) space
Compare All
Run all 4 algorithms and compare visited nodes, path length, and time.
Results
Run compare to see side-by-side results.