Dijkstra Shortest Path Monster
Find the shortest path from a starting node to all other nodes in a weighted graph using a priority queue.
0
Visited Nodes
0
PQ Heap Size
0
Total Nodes
0
Traversal Steps
DIJKSTRA PATHFINDING
Min-Priority Queue (Node:Distance)
Priority Queue is empty
Execution Log
Click Run Dijkstra to start. Select start node below.
🛠️ Graph Controls
📍 Shortest Distances
| Node | Shortest Distance |
|---|---|
| No data yet | |
⚡ Time Complexity
Min-Heap PQ
O((V + E) log V)
Space Complexity
O(V + E)