testfindpath.output

这是数据结构、算法与应用-C++语言描述的代码

Enter number of edges in 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
Graph 0 is
Number of Vertices = 7
Number of Edges = 7
0  1  1  0  0  0  0  
1  0  0  0  0  0  0  
1  0  0  1  0  0  0  
0  0  1  0  1  0  0  
0  0  0  1  0  1  1  
0  0  0  0  1  0  1  
0  0  0  0  1  1  0  


Graph 1 is
Number of Vertices = 7
Number of Edges = 7
0  1  1  0  0  0  0  
0  0  0  0  0  0  0  
0  0  0  1  0  0  0  
0  0  0  0  1  0  0  
0  0  0  0  0  1  0  
0  0  0  0  0  0  0  
0  0  0  0  1  1  0  


Graph 2 is
Number of Vertices = 7
Number of Edges = 7
3  2  
1  
4  1  
3  5  
7  6  4  
7  5  
5  6  


Graph 3 is
Number of Vertices = 7
Number of Edges = 7
3  2  

4  
5  
6  

5  6  


Graph 4 is
Number of Vertices = 7
Number of Edges = 7
0  5  6  0  0  0  0  
5  0  0  0  0  0  0  
6  0  0  1  0  0  0  
0  0  1  0  3  0  0  
0  0  0  3  0  8  9  
0  0  0  0  8  0  9  
0  0  0  0  9  9  0  


Graph 5 is
Number of Vertices = 7
Number of Edges = 7
0  5  6  0  0  0  0  
0  0  0  0  0  0  0  
0  0  0  1  0  0  0  
0  0  0  0  3  0  0  
0  0  0  0  0  8  0  
0  0  0  0  0  0  0  
0  0  0  0  9  9  0  


Graph 6 is
Number of Vertices = 7
Number of Edges = 7
3 6   2 5   
1 5   
4 1   1 6   
3 1   5 3   
7 9   6 8   4 3   
7 9   5 8   
5 9   6 9   


Graph 7 is
Number of Vertices = 7
Number of Edges = 7
3 6   2 5   

4 1   
5 3   
6 8   

5 9   6 9   


Path from 1 to 3 is 1  3  
Path from 4 to 6 is 4  5  6  
Path from 1 to 6 is 1  3  4  5  6  
Path from 1 to 3 is 1  3  
Path from 4 to 6 is 4  5  6  
Path from 1 to 6 is 1  3  4  5  6  
Path from 1 to 3 is 1  3  
Path from 4 to 6 is 4  5  7  6  
Path from 1 to 6 is 1  3  4  5  7  6  
Path from 1 to 3 is 1  3  
Path from 4 to 6 is 4  5  6  
Path from 1 to 6 is 1  3  4  5  6  
Path from 1 to 3 is 1  3  
Path from 4 to 6 is 4  5  6  
Path from 1 to 6 is 1  3  4  5  6  
Path from 1 to 3 is 1  3  
Path from 4 to 6 is 4  5  6  
Path from 1 to 6 is 1  3  4  5  6  
Path from 1 to 3 is 1  3  
Path from 4 to 6 is 4  5  7  6  
Path from 1 to 6 is 1  3  4  5  7  6  
Path from 1 to 3 is 1  3  
Path from 4 to 6 is 4  5  6  
Path from 1 to 6 is 1  3  4  5  6