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 U:
================================================
| Node | Shortest distance from U | Previous Node |
================================================
U 0 n/a
V 2 U
X 5 V
W 7 V
Y 8 W
Z 13 W
================================================
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. The prior node in the path to Z is W, and we know the shortest distance of both Z (13) and W (7), so 13 - 7 = 6 which is X.
2. The prior node in the path to Y is W, and we know the shortest distance of both Y (8) and W (7), so 8 - 7 = 1 which is Y.
That's incorrect
That's correct
The answer was: 6
The answer was: 1