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
W 3 V
Z 4 W
X 5 V
Y 5 W
U 9 V
================================================
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 (3) and V (0), so 3 - 0 = 3 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: 3
The answer was: n/a