There are six cities (City 1-City 6) serviced by a particular airline. Limited routes are available, and the distances for each of these routes are presented in the table below.

-Which nodes are involved in the shortest distance between City 1 and City 5?
A)1-2-5
B)1-3-5
C)1-2-3-5
D)1-2-4-5

Question

There are six cities (City 1-City 6) serviced by a particular airline. Limited routes are available, and the distances for each of these routes are presented in the table below.

-Which nodes are involved in the shortest distance between City 1 and City 5?
A)1-2-5 
B)1-3-5 
C)1-2-3-5 
D)1-2-4-5

Quizplus · Accepted Answer

Using Dijkstra's algorithm, we can determine the shortest path between City 1 and City 5. Starting from City 1, we can go directly to City 3 with a distance of 4. From City 3, we can go directly to City 5 with a distance of 7. Therefore, the shortest path between City 1 and City 5 is 1-3-5, which corresponds to choice B.

There Are Six Cities (City 1-City 6) Serviced by a Particular