The network in Figure 6.41 gives the distances in miles between pairs of cities 1, 2, .

Question:

The network in Figure 6.41 gives the distances in miles between pairs of cities 1, 2, . . . , and 8. Use Dijkstra’s algorithm to find the shortest route between the following cities:

(a) Cities 1 and 8

(b) Cities 1 and 6

(c) Cities 4 and 8

(d) Cities 2 and 6


FIGURE 6.41

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: