Changeset 413:9cb93f692e92 in lemon-0.x

Timestamp:

04/26/04 16:19:19 (20 years ago)

Author:

marci

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@553

Message:

misc

File:

• src/work/marci/bipartite_matching_leda.cc (modified) (3 diffs)

src/work/marci/bipartite_matching_leda.cc

@@ -15 +15 @@
 #include <time_measure.h>
 #include <for_each_macros.h>
-#include <bfs_iterator.h>
+//#include <bfs_iterator.h>
 #include <graph_wrapper.h>
 #include <maps.h>
@@ -48 +48 @@
   //for leda graph
   leda::graph lg;
-  lg.make_undirected();
+  //lg.make_undirected();
   typedef LedaGraphWrapper<leda::graph> Graph;
   Graph g(lg);
@@ -204 +204 @@
 
   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) {