diff -r 2d6c8075d9d0 -r 818510fa3d99 src/work/marci/leda/bipartite_matching_comparison.cc
--- a/src/work/marci/leda/bipartite_matching_comparison.cc	Wed Sep 29 14:12:26 2004 +0000
+++ b/src/work/marci/leda/bipartite_matching_comparison.cc	Wed Sep 29 15:30:04 2004 +0000
@@ -13,18 +13,18 @@
 #include <sage_graph.h>
 //#include <smart_graph.h>
 //#include <dimacs.h>
-#include <hugo/time_measure.h>
+#include <lemon/time_measure.h>
 #include <for_each_macros.h>
-#include <hugo/graph_wrapper.h>
+#include <lemon/graph_wrapper.h>
 #include <bipartite_graph_wrapper.h>
-#include <hugo/maps.h>
-#include <hugo/max_flow.h>
+#include <lemon/maps.h>
+#include <lemon/max_flow.h>
 
 using std::cin;
 using std::cout;
 using std::endl;
 
-using namespace hugo;
+using namespace lemon;
 
 int main() {
   //for leda graph
@@ -91,7 +91,7 @@
   MaxFlow<stGW, int, ConstMap<stGW::Edge, int>, stGW::EdgeMap<int> > 
     max_flow_test(stgw, stgw.S_NODE, stgw.T_NODE, const1map, flow/*, true*/);
   max_flow_test.run();
-  cout << "HUGO max matching algorithm based on preflow." << endl 
+  cout << "LEMON max matching algorithm based on preflow." << endl 
 	    << "Size of matching: " 
 	    << max_flow_test.flowValue() << endl;
   cout << "elapsed time: " << ts << endl << endl;
@@ -107,7 +107,7 @@
 //   FOR_EACH_LOC(stGW::EdgeIt, e, stgw) flow.set(e, 0);
 //   typedef SageGraph MutableGraph;
 //   while (max_flow_test.augmentOnBlockingFlow<MutableGraph>()) { }
-//   cout << "HUGO max matching algorithm based on blocking flow augmentation." 
+//   cout << "LEMON max matching algorithm based on blocking flow augmentation." 
 // 	    << endl << "Matching size: " 
 // 	    << max_flow_test.flowValue() << endl;
 //   cout << "elapsed time: " << ts << endl << endl;
@@ -141,7 +141,7 @@
     SageGraph::EdgeMap<int> > 
     max_flow_test(hg, s, t, cm, flow);
   max_flow_test.run();
-  cout << "HUGO max matching algorithm on SageGraph by copying the graph, based on preflow." 
+  cout << "LEMON max matching algorithm on SageGraph by copying the graph, based on preflow." 
 	    << endl 
 	    << "Size of matching: " 
 	    << max_flow_test.flowValue() << endl;