dfstree.out

来自「数据结构c++语言描述 Borland C++实现」· OUT 代码 · 共 65 行

Enter the number of vertices in the graph
Enter the number of edges in the graph
Enter edge 1
Enter edge 2
Enter edge 3
Enter edge 4
Enter edge 5
Enter edge 6
The input graph is
Vertex 1 = 3  4  2  
Vertex 2 = 3  5  1  
Vertex 3 = 1  2  
Vertex 4 = 1  5  
Vertex 5 = 4  2  
The depth-first spanning tree edges are
1 3 3 2 2 5 5 4 
Enter the number of vertices in the graph
Enter the number of edges in the graph
Enter edge 1
Enter edge 2
Enter edge 3
Enter edge 4
Enter edge 5
Enter edge 6
Enter edge 7
Enter edge 8
Enter edge 9
Enter edge 10
The input graph is
Vertex 1 = 7  5  4  
Vertex 2 = 9  3  
Vertex 3 = 8  2  
Vertex 4 = 6  1  
Vertex 5 = 6  1  
Vertex 6 = 7  5  4  
Vertex 7 = 6  1  
Vertex 8 = 9  3  
Vertex 9 = 8  2  
The graph has no spanning tree
Enter the number of vertices in the graph
Enter the number of edges in the graph
Enter edge 1
Enter edge 2
Enter edge 3
Enter edge 4
Enter edge 5
Enter edge 6
Enter edge 7
Enter edge 8
Enter edge 9
Enter edge 10
Enter edge 11
The input graph is
Vertex 1 = 7  5  4  
Vertex 2 = 9  3  
Vertex 3 = 8  2  
Vertex 4 = 8  6  1  
Vertex 5 = 6  1  
Vertex 6 = 7  5  4  
Vertex 7 = 6  1  
Vertex 8 = 4  9  3  
Vertex 9 = 8  2  
The depth-first spanning tree edges are
3 8 8 4 4 6 6 7 7 1 1 5 8 9 9 2