Interactive end-of-chapter exercises


Dijkstra's Link State Algorithm - Advanced

Consider the incomplete 6-node network shown below, with the given link costs.

Consider the completed table below, which calculates the shortest distance to all nodes from W:
================================================
|    Node     |    Shortest distance from W    |    Previous Node   |
================================================
       W                               0                                     n/a   
       Z                                3                                     W   
       V                                4                                     W   
       U                                5                                     W   
       Y                                6                                     W   
       X                                7                                     V   
================================================



Question List


1. For link X, what is the cost associated with this link? If the answer can't be determined given the information, respond with 'n/a'

2. For link Y, what is the cost associated with this link? If the answer can't be determined given the information, respond with 'n/a'




Solution


1. Because the link is never used, we cannot determine the value of X, so the answer is n/a.

2. The prior node in the path to U is W, and we know the shortest distance of both U (5) and W (0), so 5 - 0 = 5 which is Y.



That's incorrect

That's correct

The answer was: n/a

Question 1 of 2

The answer was: 5

Question 2 of 2

Try Another Problem

We gratefully acknowledge the programming and problem design work of John Broderick (UMass '21), which has really helped to substantially improve this site.

Copyright © 2010-2022 J.F. Kurose, K.W. Ross
Comments welcome and appreciated: kurose@cs.umass.edu