testallpairs.output

datastucutre and algorithms, application, in C

Enter number of edges in 5 vertex graph
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  

The weighted digraph is
100  4  2  100  8  
100  100  100  4  5  
100  100  100  1  100  
100  100  100  100  3  
100  100  100  100  100  

Working on weighted undirected graph
Cost matrix is
0 4 2 3 6 
4 0 5 4 5 
2 5 0 1 4 
3 4 1 0 3 
6 5 4 3 0 

Kay matrix is
0 0 0 3 4 
0 0 4 0 0 
0 4 0 0 4 
3 0 0 0 0 
4 0 4 0 0 

The path is 1 3 4 5 


Working on weighted directed graph
Cost matrix is
0 4 2 3 6 
100 0 100 4 5 
100 100 0 1 4 
100 100 100 0 3 
100 100 100 100 0 

Kay matrix is
0 0 0 3 4 
0 0 0 0 0 
0 0 0 0 4 
0 0 0 0 0 
0 0 0 0 0 

The path is 1 3 4 5