Question

He network in figure 6.17 gives the distances in miles between pairs of cities 1, 2,
nd 8. use dijkstra's algorithm to find the shortest route between the following cities:
:) cities 1 and 8
) cities 1 and 6
6.3 shortest-route proble
3
2
cs
7
2
2
5
8​

Answer 1

Answer:

option b is the correct answer

plz mark me brainliest