use the shortest route to determine the minimum distance from node 1 to node 7 using solver

To
1 2 3 4 5 6 7
1 100 4 6 100 100 100 100
2 4 100 3 7 9 100 100
3 6 3 100 4 100 3 100
From
4 100 7 4 100 8 5 8
5 100 9 100 8 100 100 4
6 100 100 3 5 100 100 7
7 100 100 100 8 4 7 100

To
1 2 3 4 5 6 7
1 0 0 1 0 0 0 0
2 0 0 0 0 0 0 0
3 0 0 0 0 0 1 0
From
4 0 0 0 0 0 0 0
5 0 0 0 0 0 0 0
6 0 0 0 0 0 0 1
7 0 0 0 0 0 0 0
Total IN 0 0 1 0 0 1 1

Total Distance 16
to node 7 using solver

Omar Khaled Ahmed

1711005

Total out Out-In

1 1= 1
0 0= 0
1 0= 0
0 0= 0
0 0= 0
1 0= 0
0 -1 = -1