lemon-0.x: comparison src/work/marci/bipartite_matching

equal deleted inserted replaced

-:dd4d851cdca6
+:45b71a04e907
 #include <list_graph.h>
 //#include <smart_graph.h>
 //#include <dimacs.h>
 #include <time_measure.h>
 #include <for_each_macros.h>
-#include <bfs_iterator.h>
+//#include <bfs_iterator.h>
 #include <graph_wrapper.h>
 #include <maps.h>
 #include <edmonds_karp.h>
 #include <preflow.h>
 using namespace hugo;
 int main() {
 //for leda graph
 leda::graph lg;
-lg.make_undirected();
+//lg.make_undirected();
 typedef LedaGraphWrapper<leda::graph> Graph;
 Graph g(lg);
 //for UndirListGraph
 //typedef UndirListGraph Graph;
 //     std::cout << e << ": " << pre_flow[e] << "\n";
 //   }
 //   std::cout << "\n";
 ts.reset();
-MAX_CARD_BIPARTITE_MATCHING(lg);
+leda_list<leda_edge> ml=MAX_CARD_BIPARTITE_MATCHING(lg);
 //  stGW::EdgeMap<int> pre_flow(stgw);
 //Preflow<stGW, int, ConstMap<stGW::Edge, int>, stGW::EdgeMap<int> >
 //  pre_flow_test(stgw, stgw.S_NODE, stgw.T_NODE, const1map, pre_flow, true);
 //pre_flow_test.run();
-//std::cout << "pre flow value: " << max_flow_test.flowValue() << std::endl;
+std::cout << "leda matching value: " << ml.size() << std::endl;
 std::cout << "elapsed time: " << ts << std::endl;
 //   FOR_EACH_LOC(stGW::EdgeIt, e, stgw) {
 //     std::cout << e << ": " << pre_flow[e] << "\n";
 //   }
 //   std::cout << "\n";

changeset 417	4ce3d5f675ea
parent 411	3c8801529a1f