### 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 2 W

U 6 W

V 6 W

X 7 W

Z 7 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 V is W, and we know the shortest distance of both V (6) and W (0), so 6 - 0 = 6 which is X.

2. The prior node in the path to Y is W, and we know the shortest distance of both Y (2) and W (0), so 2 - 0 = 2 which is Y.

That's incorrect

That's correct

The answer was: 6

The answer was: 2