HardMedium Frequency40 min
Dijkstra's Algorithm
Find shortest paths in weighted graphs using a min-heap priority queue.
Dijkstra's finds shortest path in weighted graphs (no negative weights). Use a min-heap to always process the closest unvisited node. O((V+E) log V).
Dijkstra's Algorithm
Dijkstra's Step-by-Step
Network Delay Time
O((V+E) log V)Answer = max(dist). If any node unreachable, return -1.Step-by-step1 / 5
Graphnodes + edges
0: src=0314
dist=[0,∞,∞,∞]. Push (0,src=0)
Source=0. Heap=[(0,0)]. dist[0]=0.