Starting Routing simulator!
Enter a filename: graph2.txt
1 2 7
2 3 1
1 5 1
4 5 2
2 5 8
4 3 2
============================
TIME=0
============================
Neighbor costs for 1:
-> node 1 = 0
-> node 2 = 7
-> node 3 = 16
-> node 4 = 16
-> node 5 = 1

1 Distance Vector Table:
   | 1 | 2 | 3 | 4 | 5 |
1  | 0 | 7 |16 |16 | 1 |
2  |16 |16 |16 |16 |16 |
5  |16 |16 |16 |16 |16 |
The Distance Vector was updated.

Neighbor costs for 2:
-> node 1 = 7
-> node 2 = 0
-> node 3 = 1
-> node 4 = 16
-> node 5 = 8

2 Distance Vector Table:
   | 1 | 2 | 3 | 4 | 5 |
1  |16 |16 |16 |16 |16 |
2  | 7 | 0 | 1 |16 | 8 |
3  |16 |16 |16 |16 |16 |
5  |16 |16 |16 |16 |16 |
The Distance Vector was updated.

Neighbor costs for 3:
-> node 1 = 16
-> node 2 = 1
-> node 3 = 0
-> node 4 = 2
-> node 5 = 16

3 Distance Vector Table:
   | 1 | 2 | 3 | 4 | 5 |
2  |16 |16 |16 |16 |16 |
3  |16 | 1 | 0 | 2 |16 |
4  |16 |16 |16 |16 |16 |
The Distance Vector was updated.

Neighbor costs for 4:
-> node 1 = 16
-> node 2 = 16
-> node 3 = 2
-> node 4 = 0
-> node 5 = 2

4 Distance Vector Table:
   | 1 | 2 | 3 | 4 | 5 |
3  |16 |16 |16 |16 |16 |
4  |16 |16 | 2 | 0 | 2 |
5  |16 |16 |16 |16 |16 |
The Distance Vector was updated.

Neighbor costs for 5:
-> node 1 = 1
-> node 2 = 8
-> node 3 = 16
-> node 4 = 2
-> node 5 = 0

5 Distance Vector Table:
   | 1 | 2 | 3 | 4 | 5 |
1  |16 |16 |16 |16 |16 |
2  |16 |16 |16 |16 |16 |
4  |16 |16 |16 |16 |16 |
5  | 1 | 8 |16 | 2 | 0 |
The Distance Vector was updated.

[0] Next step, [1] Auto-run algorithm, [2] Change link, [3] Quit: 2
Neighbor costs for 1:
-> node 1 = 0
-> node 2 = 7
-> node 3 = 16
-> node 4 = 16
-> node 5 = 1

Neighbor costs for 2:
-> node 1 = 7
-> node 2 = 0
-> node 3 = 1
-> node 4 = 16
-> node 5 = 8

Neighbor costs for 3:
-> node 1 = 16
-> node 2 = 1
-> node 3 = 0
-> node 4 = 2
-> node 5 = 16

Neighbor costs for 4:
-> node 1 = 16
-> node 2 = 16
-> node 3 = 2
-> node 4 = 0
-> node 5 = 2

Neighbor costs for 5:
-> node 1 = 1
-> node 2 = 8
-> node 3 = 16
-> node 4 = 2
-> node 5 = 0

Enter node to change cost of: 1
Neighbor costs for 1:
-> node 1 = 0
-> node 2 = 7
-> node 3 = 16
-> node 4 = 16
-> node 5 = 1

Enter destination node: 2
Enter new cost: 16
Neighbor costs for 1:
-> node 1 = 0
-> node 2 = 16
-> node 3 = 16
-> node 4 = 16
-> node 5 = 1

[0] Next step, [1] Auto-run algorithm, [2] Change link, [3] Quit: 1
============================
TIME=1
============================
1 Distance Vector Table:
   | 1 | 2 | 3 | 4 | 5 |
1  | 0 | 7 |16 | 3 | 1 |
5  | 1 | 8 |16 | 2 | 0 |
The Distance Vector was updated.

2 Distance Vector Table:
   | 1 | 2 | 3 | 4 | 5 |
2  | 7 | 0 | 1 | 3 | 8 |
3  |16 | 1 | 0 | 2 |16 |
5  | 1 | 8 |16 | 2 | 0 |
The Distance Vector was updated.

3 Distance Vector Table:
   | 1 | 2 | 3 | 4 | 5 |
2  | 7 | 0 | 1 |16 | 8 |
3  | 8 | 1 | 0 | 2 | 4 |
4  |16 |16 | 2 | 0 | 2 |
The Distance Vector was updated.

4 Distance Vector Table:
   | 1 | 2 | 3 | 4 | 5 |
3  |16 | 1 | 0 | 2 |16 |
4  | 3 | 3 | 2 | 0 | 2 |
5  | 1 | 8 |16 | 2 | 0 |
The Distance Vector was updated.

5 Distance Vector Table:
   | 1 | 2 | 3 | 4 | 5 |
1  | 0 | 7 |16 |16 | 1 |
2  | 7 | 0 | 1 |16 | 8 |
4  |16 |16 | 2 | 0 | 2 |
5  | 1 | 8 | 4 | 2 | 0 |
The Distance Vector was updated.

============================
TIME=2
============================
1 Distance Vector Table:
   | 1 | 2 | 3 | 4 | 5 |
1  | 0 | 7 | 5 | 3 | 1 |
5  | 1 | 8 | 4 | 2 | 0 |
The Distance Vector was updated.

2 Distance Vector Table:
   | 1 | 2 | 3 | 4 | 5 |
2  | 7 | 0 | 1 | 3 | 5 |
3  | 8 | 1 | 0 | 2 | 4 |
5  | 1 | 8 | 4 | 2 | 0 |
The Distance Vector was updated.

3 Distance Vector Table:
   | 1 | 2 | 3 | 4 | 5 |
2  | 7 | 0 | 1 | 3 | 8 |
3  | 5 | 1 | 0 | 2 | 4 |
4  | 3 | 3 | 2 | 0 | 2 |
The Distance Vector was updated.

4 Distance Vector Table:
   | 1 | 2 | 3 | 4 | 5 |
3  | 8 | 1 | 0 | 2 | 4 |
4  | 3 | 3 | 2 | 0 | 2 |
5  | 1 | 8 | 4 | 2 | 0 |
The Distance Vector was NOT updated.

5 Distance Vector Table:
   | 1 | 2 | 3 | 4 | 5 |
1  | 0 | 7 |16 | 3 | 1 |
2  | 7 | 0 | 1 | 3 | 8 |
4  | 3 | 3 | 2 | 0 | 2 |
5  | 1 | 5 | 4 | 2 | 0 |
The Distance Vector was updated.

============================
TIME=3
============================
1 Distance Vector Table:
   | 1 | 2 | 3 | 4 | 5 |
1  | 0 | 6 | 5 | 3 | 1 |
5  | 1 | 5 | 4 | 2 | 0 |
The Distance Vector was updated.

2 Distance Vector Table:
   | 1 | 2 | 3 | 4 | 5 |
2  | 6 | 0 | 1 | 3 | 5 |
3  | 5 | 1 | 0 | 2 | 4 |
5  | 1 | 5 | 4 | 2 | 0 |
The Distance Vector was updated.

3 Distance Vector Table:
   | 1 | 2 | 3 | 4 | 5 |
2  | 7 | 0 | 1 | 3 | 5 |
3  | 5 | 1 | 0 | 2 | 4 |
4  | 3 | 3 | 2 | 0 | 2 |
The Distance Vector was NOT updated.

4 Distance Vector Table:
   | 1 | 2 | 3 | 4 | 5 |
3  | 5 | 1 | 0 | 2 | 4 |
4  | 3 | 3 | 2 | 0 | 2 |
5  | 1 | 5 | 4 | 2 | 0 |
The Distance Vector was NOT updated.

5 Distance Vector Table:
   | 1 | 2 | 3 | 4 | 5 |
1  | 0 | 7 | 5 | 3 | 1 |
2  | 7 | 0 | 1 | 3 | 5 |
4  | 3 | 3 | 2 | 0 | 2 |
5  | 1 | 5 | 4 | 2 | 0 |
The Distance Vector was NOT updated.

============================
TIME=4
============================
1 Distance Vector Table:
   | 1 | 2 | 3 | 4 | 5 |
1  | 0 | 6 | 5 | 3 | 1 |
5  | 1 | 5 | 4 | 2 | 0 |
The Distance Vector was NOT updated.

2 Distance Vector Table:
   | 1 | 2 | 3 | 4 | 5 |
2  | 6 | 0 | 1 | 3 | 5 |
3  | 5 | 1 | 0 | 2 | 4 |
5  | 1 | 5 | 4 | 2 | 0 |
The Distance Vector was NOT updated.

3 Distance Vector Table:
   | 1 | 2 | 3 | 4 | 5 |
2  | 6 | 0 | 1 | 3 | 5 |
3  | 5 | 1 | 0 | 2 | 4 |
4  | 3 | 3 | 2 | 0 | 2 |
The Distance Vector was NOT updated.

4 Distance Vector Table:
   | 1 | 2 | 3 | 4 | 5 |
3  | 5 | 1 | 0 | 2 | 4 |
4  | 3 | 3 | 2 | 0 | 2 |
5  | 1 | 5 | 4 | 2 | 0 |
The Distance Vector was NOT updated.

5 Distance Vector Table:
   | 1 | 2 | 3 | 4 | 5 |
1  | 0 | 6 | 5 | 3 | 1 |
2  | 6 | 0 | 1 | 3 | 5 |
4  | 3 | 3 | 2 | 0 | 2 |
5  | 1 | 5 | 4 | 2 | 0 |
The Distance Vector was NOT updated.

Reached STABLE state at T=4