indep.out

数据结构c++语言描述 Borland C++实现

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
The input graph is
Vertex 1 = 2  
Vertex 2 = 3  5  1  
Vertex 3 = 2  
Vertex 4 = 5  
Vertex 5 = 4  2  
Vertex 6 = 8  7  
Vertex 7 = 9  6  
Vertex 8 = 9  6  
Vertex 9 = 7  8  
The independent set size is 5
The independent set vertices are
1 3 4 6 9 
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 = 2  
Vertex 2 = 3  5  1  
Vertex 3 = 2  
Vertex 4 = 6  5  
Vertex 5 = 4  2  
Vertex 6 = 4  9  8  7  
Vertex 7 = 9  6  
Vertex 8 = 9  6  
Vertex 9 = 7  6  8  
The independent set size is 5
The independent set vertices are
1 3 5 7 8 
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
Enter edge 12
Enter edge 13
Enter edge 14
Enter edge 15
Enter edge 16
Enter edge 17
The input graph is
Vertex 1 = 4  
Vertex 2 = 12  11  
Vertex 3 = 12  13  11  
Vertex 4 = 5  1  
Vertex 5 = 7  4  
Vertex 6 = 11  7  
Vertex 7 = 6  5  
Vertex 8 = 9  
Vertex 9 = 11  14  8  
Vertex 10 = 11  
Vertex 11 = 6  9  13  12  10  3  2  
Vertex 12 = 3  11  13  2  
Vertex 13 = 11  3  12  
Vertex 14 = 9  
The independent set size is 8
The independent set vertices are
1 2 5 6 8 10 13 14