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