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 W:
================================================
| Node | Shortest distance from W | Previous Node |
================================================
W 0 n/a
Y 1 W
U 3 W
X 3 W
V 4 W
Z 4 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 X is W, and we know the shortest distance of both X (3) and W (0), so 3 - 0 = 3 which is X.
2. The prior node in the path to U is W, and we know the shortest distance of both U (3) and W (0), so 3 - 0 = 3 which is Y.
That's incorrect
That's correct
The answer was: 3
The answer was: 3