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