Watch Dijkstra's Algorithm discover the shortest route, one decision at a time.
Select a source and destination, then press Find Shortest Route.
| Vertex | Distance | Previous | Status |
|---|---|---|---|
| A | ∞ | — | UNVISITED |
| B | ∞ | — | UNVISITED |
| C | ∞ | — | UNVISITED |
| D | ∞ | — | UNVISITED |
| E | ∞ | — | UNVISITED |
| F | ∞ | — | UNVISITED |
| G | ∞ | — | UNVISITED |
Queue is empty.