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 4 U
W 4 U
X 5 U
Z 11 W
Y 12 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 (11) and W (4), so 11 - 4 = 7 which is X.
2. The prior node in the path to Y is W, and we know the shortest distance of both Y (12) and W (4), so 12 - 4 = 8 which is Y.
That's incorrect
That's correct
The answer was: 7
The answer was: 8