bipart2.out

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

Enter number of vertices in the graph
Enter number of edges in the graph
Enter end points of next edge
Enter end points of next edge
Enter end points of next edge
Enter end points of next edge
Enter end points of next edge
Enter end points of next edge
Enter end points of next edge
Enter end points of next edge
Enter end points of next edge
Enter end points of next edge
The input graph is described below
The graph has 9 vertices
There is an edge from vertex 1 to vertex (vertices) 7  5  4  
There is an edge from vertex 2 to vertex (vertices) 9  3  
There is an edge from vertex 3 to vertex (vertices) 8  2  
There is an edge from vertex 4 to vertex (vertices) 6  1  
There is an edge from vertex 5 to vertex (vertices) 6  1  
There is an edge from vertex 6 to vertex (vertices) 7  5  4  
There is an edge from vertex 7 to vertex (vertices) 6  1  
There is an edge from vertex 8 to vertex (vertices) 9  3  
There is an edge from vertex 9 to vertex (vertices) 8  2  
The graph is bipartite
The vertex labels are
1 1 2 2 2 1 2 1 2