Changeset 648:8c13444bccf6 in lemon-0.x for src/work/marci/leda/bipartite_matching_leda_gen.cc

Timestamp:

05/19/04 18:20:10 (21 years ago)

Author:

marci

Branch:

default

Phase:

public

Convert:

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

Message:

for_each fix

File:

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

src/work/marci/leda/bipartite_matching_leda_gen.cc

@@ -11 +11 @@
 
 #include <leda_graph_wrapper.h>
-#include <list_graph.h>
+#include <sage_graph.h>
 //#include <smart_graph.h>
 //#include <dimacs.h>
 #include <hugo/time_measure.h>
-#include <for_each_macros.h>
+#include <hugo/for_each_macros.h>
 #include <hugo/graph_wrapper.h>
 #include <bipartite_graph_wrapper.h>
@@ -52 +52 @@
   Graph g(lg);
 
-  //for UndirListGraph
-  //typedef UndirListGraph Graph; 
+  //for UndirSageGraph
+  //typedef UndirSageGraph Graph; 
   //Graph g;
 
@@ -125 +125 @@
   ts.reset();
   FOR_EACH_LOC(stGW::EdgeIt, e, stgw) flow.set(e, 0);
-  typedef ListGraph MutableGraph;
+  typedef SageGraph MutableGraph;
   while (max_flow_test.augmentOnBlockingFlow<MutableGraph>()) { }
   std::cout << "HUGO max matching algorithm based on blocking flow augmentation."