-In Figure 2a, using the shortest route algorithm presented in the text book, the label and the node that would get the permanent label next, will be
A)3 and $[5,2]$
B) 4 and $[8,2]$
C) 5 and $[7,1]$
D) 2and $[3,1]$

Question

-In Figure 2a, using the shortest route algorithm presented in the text book, the label and the node that would get the permanent label next, will be 
A)3 and $[5,2]$ 
B) 4 and $[8,2]$ 
C) 5 and $[7,1]$ 
D) 2and $[3,1]$

Quizplus · Accepted Answer

The shortest route algorithm assigns permanent labels to nodes based on the shortest known distance from the starting node. Given the options, node 3 with label $[5,2]$ is the next shortest distance that hasn't been permanently labeled yet.

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