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