Dijkstra Simulator
Graph Type: Undirected
Nodes (V): 5
Edges (E): 7
Classic Shortest Path
A standard weighted graph. Watch Dijkstra prioritize paths with the smallest total weight to reach the target.
Priority Queue (Min Dist)
Empty
A
d:0
Start
B
d:∞
C
d:∞
D
d:∞
E
d:∞
End
Animation Speed — 1000ms
Routing Table (Shortest Distances)
| Destination | Cost from Start (g) | Previous | Visited |
|---|---|---|---|
| AStart | 0 | - | 0 |
| B | ∞ | - | 0 |
| C | ∞ | - | 0 |
| D | ∞ | - | 0 |
| E | ∞ | - | 0 |
Final Path:
Pending calculation...
Explanation: Shortest Paths:
A → A = 0: Source node itself, so distance is 0.