diff -r a5e9303a5511 -r eb61fbc64c16 src/work/marci/leda/bipartite_matching_leda_gen.cc
--- a/src/work/marci/leda/bipartite_matching_leda_gen.cc	Mon Aug 23 11:06:00 2004 +0000
+++ b/src/work/marci/leda/bipartite_matching_leda_gen.cc	Mon Aug 23 11:26:09 2004 +0000
@@ -14,11 +14,12 @@
 //#include <smart_graph.h>
 //#include <dimacs.h>
 #include <hugo/time_measure.h>
-#include <hugo/for_each_macros.h>
+#include <for_each_macros.h>
 #include <hugo/graph_wrapper.h>
 #include <bipartite_graph_wrapper.h>
 #include <hugo/maps.h>
-#include <max_flow.h>
+#include <hugo/max_flow.h>
+#include <augmenting_flow.h>
 
 /**
  * Inicializalja a veletlenszamgeneratort.
@@ -125,10 +126,12 @@
   ts.reset();
   FOR_EACH_LOC(stGW::EdgeIt, e, stgw) flow.set(e, 0);
   typedef SageGraph MutableGraph;
-  while (max_flow_test.augmentOnBlockingFlow<MutableGraph>()) { }
+  AugmentingFlow<stGW, int, ConstMap<stGW::Edge, int>, stGW::EdgeMap<int> > 
+    max_flow_test_1(stgw, stgw.S_NODE, stgw.T_NODE, const1map, flow/*, true*/);
+  while (max_flow_test_1.augmentOnBlockingFlow<MutableGraph>()) { }
   std::cout << "HUGO max matching algorithm based on blocking flow augmentation." 
 	    << std::endl << "Matching size: " 
-	    << max_flow_test.flowValue() << std::endl;
+	    << max_flow_test_1.flowValue() << std::endl;
   std::cout << "elapsed time: " << ts << std::endl;
 
   return 0;