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