Algorithm 1 Dijkstra’s algorithm
1	Dijkstra(G, s)
2	dist[s] = 0
3	for each vertex v∈V
4	if v ≠ s
5	dist[v] = ∞
6	pre [v] = undefined
7	S = Ø
8	Q = V
9	whileQ ≠ Ø do
10	u = extract_min(Q)
11	S = S∪{u}
12	for each vertex v∈Adj(u) do
13	dist[v] = min(dist[v], dist[u]+w(u, v))
14	pre[v] = u