closure.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
0 1 1 1 0 
0 0 1 0 0 
0 0 0 1 1 
0 1 0 0 0 
0 1 0 0 0 
The reflexive transitive closure is
1 1 1 1 1 
0 1 1 1 1 
0 1 1 1 1 
0 1 1 1 1 
0 1 1 1 1 
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
0 1 0 0 0 0 0 0 0 
0 0 1 0 0 0 0 0 0 
0 0 0 1 0 0 0 0 0 
0 0 0 0 1 0 0 0 0 
0 0 0 0 0 1 0 0 0 
0 0 0 0 0 0 1 0 0 
0 0 0 0 0 0 0 1 0 
0 0 0 0 0 0 0 0 1 
0 0 0 0 0 0 0 0 0 
The reflexive transitive closure is
1 1 1 1 1 1 1 1 1 
0 1 1 1 1 1 1 1 1 
0 0 1 1 1 1 1 1 1 
0 0 0 1 1 1 1 1 1 
0 0 0 0 1 1 1 1 1 
0 0 0 0 0 1 1 1 1 
0 0 0 0 0 0 1 1 1 
0 0 0 0 0 0 0 1 1 
0 0 0 0 0 0 0 0 1 
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
The input graph is
0 0 0 1 1 0 1 0 0 
0 0 1 0 0 0 0 0 1 
0 0 0 0 0 0 0 0 0 
0 0 0 0 0 0 0 0 0 
0 0 0 0 0 0 0 0 0 
0 0 0 1 0 0 0 0 0 
0 0 0 0 0 0 0 0 0 
0 0 1 0 0 0 0 0 0 
0 0 0 0 0 0 0 0 0 
The reflexive transitive closure is
1 0 0 1 1 0 1 0 0 
0 1 1 0 0 0 0 0 1 
0 0 1 0 0 0 0 0 0 
0 0 0 1 0 0 0 0 0 
0 0 0 0 1 0 0 0 0 
0 0 0 1 0 1 0 0 0 
0 0 0 0 0 0 1 0 0 
0 0 1 0 0 0 0 1 0 
0 0 0 0 0 0 0 0 1