In Example 6.3-5, use Floyd’s algorithm to determine the shortest routes between each of the following pairs of nodes:

(a) From node 5 to node 1.

(b) From node 3 to node 5.

(c) From node 5 to node 3.

(d) From node 5 to node 2.

Example 6.3-5

For the network in Figure 6.15, find the shortest routes between all pairs of nodes. The distances (in miles) are given on the arcs. Arc (3, 5) is directed—no traffic is allowed from node 5 to node 3. All other arcs allow two-way traffic.

FIGURE 6.15

1 3 10 2 3 5 6 15 4 4 5