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
X 1 V
U 2 V
Y 4 X
W 5 Y
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 X is V, and we know the shortest distance of both X (1) and V (0), so 1 - 0 = 1 which is X.
2. Because the link is never used, we cannot determine the value of Y, so the answer is n/a.
That's incorrect
That's correct
The answer was: 1
The answer was: n/a