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