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