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 Y:
================================================
| Node | Shortest distance from Y | Previous Node |
================================================
Y 0 n/a
W 3 Y
Z 3 Y
X 8 Y
U 10 W
V 12 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. Because the link is never used, we cannot determine the value of X, so the answer is n/a.
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: n/a
The answer was: n/a