Use the Dijkstra algorithm (Table 11.3) to find the shortest paths for all nodes in the graph of Figure 11.61

Table 11.3 DUkstra's Algorithm

Figure 11.61 Exercise 18

Transcribed Image Text:

1 Dijkstra ( ) 2 { 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 // Initialization Path = {s} for (1=1 to N) { if (1 is a neighbor of s and 1 s) if (1 is not a neighbor of s) } D₂ = 0 // s means self // Dijkstra // Iteration Repeat { D₁ - Cai D₁ - 00 // Finding the next node to be added Path = Path U 1 if D₁ is minimum among all remaining nodes D₁ = minimum (Dj, Dj + C1y) // Update the shortest distance for the rest for (j = 1 to M) // M number of remaining nodes { } } until (all nodes included in the path, M = 0) A C B D 1 Dijkstra ( ) 2 { 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 // Initialization Path = {s} for (1=1 to N) { if (1 is a neighbor of s and 1 s) if (1 is not a neighbor of s) } D₂ = 0 // s means self // Dijkstra // Iteration Repeat { D₁ - Cai D₁ - 00 // Finding the next node to be added Path = Path U 1 if D₁ is minimum among all remaining nodes D₁ = minimum (Dj, Dj + C1y) // Update the shortest distance for the rest for (j = 1 to M) // M number of remaining nodes { } } until (all nodes included in the path, M = 0) A C B D

Answer rating: 100% (QA)

Dijkstra Algorithm To find the shortest path between the nodes Dijkstra algorithm is used Set the ro... View the full answer