Live simulationPAUSED
What you are exploring
Dijkstra’s algorithm repeatedly settles the unvisited node with the lowest known path cost. With non-negative edge weights it guarantees a shortest path. The grid includes blocked cells and terrain costs to make the route choice visible.