Click cells to toggle walls. Use Set Start or Set End to place endpoints, then hit Run.
Unvisited
Frontier
Visited
Shortest path
Start
End
Wall
—
Path Length
0
Visited Cells
0
Frontier Size
Ready
Status
35 ms
What you’re seeing
Dijkstra’s algorithm always expands the lowest-distance frontier node first. On a uniform-cost grid that behaves similarly to BFS, but this implementation keeps the true Dijkstra bookkeeping with distances and predecessor links.
- Yellow cells are queued in the frontier.
- Blue cells have been permanently settled with the shortest known distance.
- Bright green cells are the final shortest path from start to end.