Graphs II: Basic Algorithms :

Algorithm Dijkstra_shortest_path(G, v_0)

Step 1: for each vertex v_i in V do
Step 2:     dist[v_i} = infinity
Step 3: distance[v₀] = 0;
Step 4:     for each vertex v_i in V do
Step 5:         insert(Q, v_i)
Step 6: S = empty
Step 7: while (Q not empty) do
Step 8:         v_i = Min(Q)
Step 9:         for each vertex v_j adjacent to v_i do
Step 10:       distance[v_j] = Minimum (distance[v_j], distance[v_i] + w[v_i,v_j])

• Consider the following graph: