Entered vertex 0 with destination 1 of weight 1
Entered vertex 0 with destination 2 of weight 10
Entered vertex 0 with destination 4 of weight 2
Entered vertex 1 with destination 3 of weight 4
Entered vertex 2 with destination 5 of weight 10
Entered vertex 3 with destination 6 of weight 2
Entered vertex 4 with destination 3 of weight 1
Entered vertex 4 with destination 2 of weight 2
Entered vertex 4 with destination 7 of weight 10
Entered vertex 4 with destination 0 of weight 1
Entered vertex 5 with destination 7 of weight 1
Entered vertex 6 with destination 5 of weight 1
Entered vertex 6 with destination 7 of weight 3
Entered vertex 7 with destination 2 of weight 1
0 -->[1|*-]-->[2|*-]-->[4|*-]--|||
1 -->[3|*-]--|||
2 -->[5|*-]--|||
3 -->[6|*-]--|||
4 -->[0|*-]-->[2|*-]-->[3|*-]-->[7|*-]--|||
5 -->[7|*-]--|||
6 -->[5|*-]-->[7|*-]--|||
7 -->[2|*-]--|||
	Using 0 as the source vertex:
The distance from 0 to 1 is 1
The shortest path from 0 to 1 is with hops:
0 to 1 of weight 1
The distance from 0 to 2 is 4
The shortest path from 0 to 2 is with hops:
0 to 4 of weight 2
4 to 2 of weight 2
The distance from 0 to 3 is 3
The shortest path from 0 to 3 is with hops:
0 to 4 of weight 2
4 to 3 of weight 1
The distance from 0 to 4 is 2
The shortest path from 0 to 4 is with hops:
0 to 4 of weight 2
The distance from 0 to 5 is 6
The shortest path from 0 to 5 is with hops:
0 to 4 of weight 2
4 to 3 of weight 1
3 to 6 of weight 2
6 to 5 of weight 1
The distance from 0 to 6 is 5
The shortest path from 0 to 6 is with hops:
0 to 4 of weight 2
4 to 3 of weight 1
3 to 6 of weight 2
The distance from 0 to 7 is 7
The shortest path from 0 to 7 is with hops:
0 to 4 of weight 2
4 to 3 of weight 1
3 to 6 of weight 2
6 to 5 of weight 1
5 to 7 of weight 1
	Using 1 as the source vertex:
There is no path from 1 to 0.
The distance from 1 to 2 is 9
The shortest path from 1 to 2 is with hops:
1 to 3 of weight 4
3 to 6 of weight 2
6 to 5 of weight 1
5 to 7 of weight 1
7 to 2 of weight 1
The distance from 1 to 3 is 4
The shortest path from 1 to 3 is with hops:
1 to 3 of weight 4
There is no path from 1 to 4.
The distance from 1 to 5 is 7
The shortest path from 1 to 5 is with hops:
1 to 3 of weight 4
3 to 6 of weight 2
6 to 5 of weight 1
The distance from 1 to 6 is 6
The shortest path from 1 to 6 is with hops:
1 to 3 of weight 4
3 to 6 of weight 2
The distance from 1 to 7 is 8
The shortest path from 1 to 7 is with hops:
1 to 3 of weight 4
3 to 6 of weight 2
6 to 5 of weight 1
5 to 7 of weight 1
	Using 3 as the source vertex:
There is no path from 3 to 0.
There is no path from 3 to 1.
The distance from 3 to 2 is 5
The shortest path from 3 to 2 is with hops:
3 to 6 of weight 2
6 to 5 of weight 1
5 to 7 of weight 1
7 to 2 of weight 1
There is no path from 3 to 4.
The distance from 3 to 5 is 3
The shortest path from 3 to 5 is with hops:
3 to 6 of weight 2
6 to 5 of weight 1
The distance from 3 to 6 is 2
The shortest path from 3 to 6 is with hops:
3 to 6 of weight 2
The distance from 3 to 7 is 4
The shortest path from 3 to 7 is with hops:
3 to 6 of weight 2
6 to 5 of weight 1
5 to 7 of weight 1