-In Figure 2a, using the shortest route algorithm presented in the text book, the shortest distance from node 1 to node 6 will be
A) 16
B) 10
C) 19
D) 6

Question

-In Figure 2a, using the shortest route algorithm presented in the text book, the shortest distance from node 1 to node 6 will be
A) 16 
B) 10 
C) 19 
D) 6

Quizplus · Accepted Answer

The shortest route algorithm, such as Dijkstra's algorithm, calculates the shortest path from a starting node to a destination node. Based on the given options, 10 is the shortest distance from node 1 to node 6.

-In Figure 2a, Using the Shortest Route Algorithm Presented in the Text