129 std::cout << std::endl; |
129 std::cout << std::endl; |
130 |
130 |
131 ts.reset(); |
131 ts.reset(); |
132 FOR_EACH_LOC(Graph::EdgeIt, e, g) gef.set(e, 0); |
132 FOR_EACH_LOC(Graph::EdgeIt, e, g) gef.set(e, 0); |
133 FOR_EACH_LOC(Graph::NodeIt, n, g) gnf.set(n, 0); |
133 FOR_EACH_LOC(Graph::NodeIt, n, g) gnf.set(n, 0); |
134 MaxMatching<Graph, ConstMap<Graph::Edge, int>, ConstMap<Graph::Node, int>, |
134 MaxBipartiteMatching<Graph, ConstMap<Graph::Edge, int>, ConstMap<Graph::Node, int>, |
135 Graph::EdgeMap<int>, Graph::NodeMap<int> > |
135 Graph::EdgeMap<int>, Graph::NodeMap<int> > |
136 matching_test(g, ge1, gn1, gef, gnf); |
136 matching_test(g, ge1, gn1, gef, gnf); |
137 matching_test.run(); |
137 matching_test.run(); |
138 |
138 |
139 std::cout << "max flow value: " << matching_test.matchingValue() << std::endl; |
139 std::cout << "max flow value: " << matching_test.matchingValue() << std::endl; |
144 std::cout << std::endl; |
144 std::cout << std::endl; |
145 |
145 |
146 ts.reset(); |
146 ts.reset(); |
147 FOR_EACH_LOC(Graph::EdgeIt, e, g) gef.set(e, 0); |
147 FOR_EACH_LOC(Graph::EdgeIt, e, g) gef.set(e, 0); |
148 //FOR_EACH_LOC(Graph::NodeIt, n, g) gnf.set(n, 0); |
148 //FOR_EACH_LOC(Graph::NodeIt, n, g) gnf.set(n, 0); |
149 MaxMatching<Graph, ConstMap<Graph::Edge, int>, ConstMap<Graph::Node, int>, |
149 MaxBipartiteMatching<Graph, ConstMap<Graph::Edge, int>, ConstMap<Graph::Node, int>, |
150 Graph::EdgeMap<int>, Graph::NodeMap<int> > |
150 Graph::EdgeMap<int>, Graph::NodeMap<int> > |
151 matching_test_1(g, ge1, gn1, gef/*, gnf*/); |
151 matching_test_1(g, ge1, gn1, gef/*, gnf*/); |
152 matching_test_1.run(); |
152 matching_test_1.run(); |
153 |
153 |
154 std::cout << "max flow value: " << matching_test_1.matchingValue() << std::endl; |
154 std::cout << "max flow value: " << matching_test_1.matchingValue() << std::endl; |