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