74 |
74 |
75 std::cout << "Edges of the bipartite graph:" << std::endl; |
75 std::cout << "Edges of the bipartite graph:" << std::endl; |
76 FOR_EACH_LOC(EdgeIt, e, g) std::cout << e << " "; |
76 FOR_EACH_LOC(EdgeIt, e, g) std::cout << e << " "; |
77 std::cout << std::endl; |
77 std::cout << std::endl; |
78 |
78 |
|
79 std::cout << "Nodes:" << std::endl; |
|
80 FOR_EACH_LOC(Graph::NodeIt, v, g) std::cout << v << " "; |
|
81 std::cout << std::endl; |
79 std::cout << "Nodes in T:" << std::endl; |
82 std::cout << "Nodes in T:" << std::endl; |
80 FOR_EACH_INC_LOC(Graph::ClassNodeIt, v, g, g.T_CLASS) std::cout << v << " "; |
83 FOR_EACH_INC_LOC(Graph::ClassNodeIt, v, g, Graph::T_CLASS) std::cout << v << " "; |
81 std::cout << std::endl; |
84 std::cout << std::endl; |
82 std::cout << "Nodes in S:" << std::endl; |
85 std::cout << "Nodes in S:" << std::endl; |
83 FOR_EACH_INC_LOC(Graph::ClassNodeIt, v, g, g.S_CLASS) std::cout << v << " "; |
86 FOR_EACH_INC_LOC(Graph::ClassNodeIt, v, g, Graph::S_CLASS) std::cout << v << " "; |
84 std::cout << std::endl; |
87 std::cout << std::endl; |
85 |
88 |
86 std::cout << "Erasing the first node..." << std::endl; |
89 std::cout << "Erasing the first node..." << std::endl; |
87 NodeIt n; |
90 NodeIt n; |
88 g.first(n); |
91 g.first(n); |
90 std::cout << "Nodes of the bipartite graph:" << std::endl; |
93 std::cout << "Nodes of the bipartite graph:" << std::endl; |
91 FOR_EACH_GLOB(n, g) std::cout << n << " "; |
94 FOR_EACH_GLOB(n, g) std::cout << n << " "; |
92 std::cout << std::endl; |
95 std::cout << std::endl; |
93 |
96 |
94 std::cout << "Nodes in T:" << std::endl; |
97 std::cout << "Nodes in T:" << std::endl; |
95 FOR_EACH_INC_LOC(Graph::ClassNodeIt, v, g, g.T_CLASS) std::cout << v << " "; |
98 FOR_EACH_INC_LOC(Graph::ClassNodeIt, v, g, Graph::T_CLASS) std::cout << v << " "; |
96 std::cout << std::endl; |
99 std::cout << std::endl; |
97 std::cout << "Nodes in S:" << std::endl; |
100 std::cout << "Nodes in S:" << std::endl; |
98 FOR_EACH_INC_LOC(Graph::ClassNodeIt, v, g, g.S_CLASS) std::cout << v << " "; |
101 FOR_EACH_INC_LOC(Graph::ClassNodeIt, v, g, Graph::S_CLASS) std::cout << v << " "; |
99 std::cout << std::endl; |
102 std::cout << std::endl; |
100 |
103 |
101 typedef stGraphWrapper<Graph> stGW; |
104 typedef stGraphWrapper<Graph> stGW; |
102 stGW stgw(g); |
105 stGW stgw(g); |
103 ConstMap<stGW::Edge, int> const1map(1); |
106 ConstMap<stGW::Edge, int> const1map(1); |