Pathfinding Lab: Dijkstra vs A*
Drag on either grid to draw walls. Pick Start or End, then click to move them. Both grids update live.
Dijkstra explores by cost only
0cells explored
-path steps
A* cost plus a distance guess toward the end
0cells explored
-path steps
frontier (queued)
explored
just explored
shortest path
wall