testbellmanford.output

datastucutre and algorithms, application, in C

Enter number of vertices and edges
Enter weighted edge 1
Enter weighted edge 2
Enter weighted edge 3
Enter weighted edge 4
Enter weighted edge 5
Enter weighted edge 6
Enter weighted edge 7
The weighted undirected graph is
100  4  2  100  8  
4  100  100  4  5  
2  100  100  1  100  
100  4  1  100  3  
8  5  100  3  100  
Enter number of vertices and edges
Enter weighted edge 1
Enter weighted edge 2
Enter weighted edge 3
Enter weighted edge 4
Enter weighted edge 5
Enter weighted edge 6
Enter weighted edge 7
Enter weighted edge 8

The weighted digraph is
100  9  7  100  6  8  
100  100  -3  100  100  100  
100  100  100  100  -3  100  
100  100  -1  100  100  100  
100  100  100  100  100  100  
100  100  100  -2  100  100  
The dist and p values for the graph are
0 0
4 1
2 1
3 3
6 4
The dist and p values for the graph are
0 0
4 1
2 1
3 3
6 4
The dist and p values for the graph are
0 0
9 1
5 4
6 6
2 3
8 1
The dist and p values for the graph are
0 0
9 1
5 4
6 6
2 3
8 1