A* / Dijkstra / Floyd Simulator — step-by-step visualization

Controls: Click cells to toggle obstacle. Shift+Click sets Start. Ctrl+Click sets Goal.
Start: (0,0) Goal: (19,19)
Operation counts
A*: -
Dijkstra: -
Floyd: -
Notes
Floyd-Warshall computes all-pairs shortest paths and is O(N³) where N = number of nodes (free cells). To avoid freezing, Floyd runs only when N ≤ 400.
A* open/explored Dijkstra explored DFS/Breadth (not used) Start Goal Obstacle Final path
Open the canvas and click Generate. Use buttons to run algorithms step-by-step. Operation counts shown measure node expansions, neighbor checks and heap ops (approx).