DIJKSTRA ALGORITHM

Dijkstra(G,s):
1 for each vertex u G.V - {s}
2
u.d =
3
u.pred = null
4
u.done = false
5 s.d = 0
6 Q = G.V
7 while Q
8
u = Q.extractMin()
9
u.done = true
10
for each v G.Adj[u]
11
Relax(u,v)
Relax(G,u,v):
1 if u.d + G.edge(u,v).w < v.d
2
v.d = u.d + G.edge(u,v).w
3
v.pred = u