Use the Bellman-Ford algorithm (Table 11.1) to find the shortest distance for all nodes in the graph of Figure 11.60.

Table 11.1 Bellman-Ford Algorithm

1 Bellman_Ford ( ) 2 ( 3 4 5 6 7 // Initialization for (1=1 to N; for j = 1 to N) ( if (1 == j) Dy = 0 else Day = 00 8 9 10 11 12 13 14 15 16 17 } // end Bellman-Ford Figure 11.60 Exercise 17 } // Updating repeat ( C19 = 0 C = cost between 1 and j for (1 = 1 to N; for j = 1 to N) ( Dij } // end for until (there was no change in previous iteration) minimum [(C1 + Dy) (CN + D)]