-In Figure 1, using the shortest route algorithm presented in the text book, the node that would be labeled with a permanent label next will be
A)1
B) 2
C) 3
D) 5

Question

-In Figure 1, using the shortest route algorithm presented in the text book, the node that would be labeled with a permanent label next will be 
A)1 
B) 2 
C) 3 
D) 5

Quizplus · Accepted Answer

The shortest route algorithm, often Dijkstra's algorithm, labels nodes with the shortest distance from the starting point, making permanent the smallest tentative distance. Without seeing Figure 1, the correct answer can't be determined from the question alone, but based on how these algorithms work, the next node to be labeled with a permanent label is typically the one with the smallest cumulative distance from the start node that hasn't yet been permanently labeled.

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