First update:
Distance vector (Node A)
| Node |
B |
C |
D |
E |
F |
| Distance |
INF |
2 |
INF |
5 |
INF |
Recieved distance vector (Node C)
| Node |
A |
B |
D |
E |
F |
| Distance |
2 |
INF |
4 |
2 |
INF |
Updated distance vector (Node A)
Dist(A, x) = min(Dist(A, x), {Dist(A, C)+Dist(C, x)})
Second update:
Distance vector (Node A)
| Node |
B |
C |
D |
E |
F |
| Distance |
INF |
2 |
6 |
4 |
INF |
Recieved distance vector (Node E)
| Node |
A |
B |
C |
D |
F |
| Distance |
5 |
1 |
2 |
INF |
2 |
Updated distance vector (Node A)
Dist(A, x) = min(Dist(A, x), {Dist(A, E)+Dist(E, x)})
Third update:
Distance vector (Node A)
| Node |
B |
C |
D |
E |
F |
| Distance |
5 |
2 |
6 |
4 |
6 |
Recieved distance vector (Node E)
| Node |
A |
B |
C |
D |
F |
| Distance |
4 |
1 |
2 |
3 |
2 |
Updated distance vector (Node A)
Dist(A, x) = mini(Dist(A, x), {Dist(A, E)+Dist(E, x)})