Multiple Choice
-In Figure 2b, using backtracking step of the shortest route algorithm, the shortest route from node 1 to node 6 is
A)
B)
C)
D)
Correct Answer:

Verified
Correct Answer:
Verified
Q7: <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB10310/.jpg" alt=" -In Figure 1,
Q8: In the minimal spanning tree algorithm given
Q9: <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB10310/.jpg" alt=" -In Figure 2a,
Q10: In the shortest path algorithm given in
Q11: In the minimal spanning tree algorithm given
Q13: Flow conservation is assumed in the spanning
Q14: <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB10310/.jpg" alt=" -In Figure 1,
Q15: <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB10310/.jpg" alt=" -In Figure 3b,
Q16: The maximum flow in a network will
Q17: What is not true in the shortest