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
X 4 U
W 5 X
Z 6 W
V 7 U
Y 9 X
================================================
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 U, and we know the shortest distance of both V (7) and U (0), so 7 - 0 = 7 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: 7
The answer was: n/a