tetsshortestpaths.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
0  4  2  0  8  
4  0  0  4  5  
2  0  0  1  0  
0  4  1  0  3  
8  5  0  3  0  

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

The dist and p values for the directed graph are
0 0
4 1
2 1
3 3
6 4