1.1 --- a/src/work/marci/leda/bipartite_matching_comparison.cc	Wed Sep 29 14:12:26 2004 +0000
     1.2 +++ b/src/work/marci/leda/bipartite_matching_comparison.cc	Wed Sep 29 15:30:04 2004 +0000
     1.3 @@ -13,18 +13,18 @@
     1.4  #include <sage_graph.h>
     1.5  //#include <smart_graph.h>
     1.6  //#include <dimacs.h>
     1.7 -#include <hugo/time_measure.h>
     1.8 +#include <lemon/time_measure.h>
     1.9  #include <for_each_macros.h>
    1.10 -#include <hugo/graph_wrapper.h>
    1.11 +#include <lemon/graph_wrapper.h>
    1.12  #include <bipartite_graph_wrapper.h>
    1.13 -#include <hugo/maps.h>
    1.14 -#include <hugo/max_flow.h>
    1.15 +#include <lemon/maps.h>
    1.16 +#include <lemon/max_flow.h>
    1.17  
    1.18  using std::cin;
    1.19  using std::cout;
    1.20  using std::endl;
    1.21  
    1.22 -using namespace hugo;
    1.23 +using namespace lemon;
    1.24  
    1.25  int main() {
    1.26    //for leda graph
    1.27 @@ -91,7 +91,7 @@
    1.28    MaxFlow<stGW, int, ConstMap<stGW::Edge, int>, stGW::EdgeMap<int> > 
    1.29      max_flow_test(stgw, stgw.S_NODE, stgw.T_NODE, const1map, flow/*, true*/);
    1.30    max_flow_test.run();
    1.31 -  cout << "HUGO max matching algorithm based on preflow." << endl 
    1.32 +  cout << "LEMON max matching algorithm based on preflow." << endl 
    1.33  	    << "Size of matching: " 
    1.34  	    << max_flow_test.flowValue() << endl;
    1.35    cout << "elapsed time: " << ts << endl << endl;
    1.36 @@ -107,7 +107,7 @@
    1.37  //   FOR_EACH_LOC(stGW::EdgeIt, e, stgw) flow.set(e, 0);
    1.38  //   typedef SageGraph MutableGraph;
    1.39  //   while (max_flow_test.augmentOnBlockingFlow<MutableGraph>()) { }
    1.40 -//   cout << "HUGO max matching algorithm based on blocking flow augmentation." 
    1.41 +//   cout << "LEMON max matching algorithm based on blocking flow augmentation." 
    1.42  // 	    << endl << "Matching size: " 
    1.43  // 	    << max_flow_test.flowValue() << endl;
    1.44  //   cout << "elapsed time: " << ts << endl << endl;
    1.45 @@ -141,7 +141,7 @@
    1.46      SageGraph::EdgeMap<int> > 
    1.47      max_flow_test(hg, s, t, cm, flow);
    1.48    max_flow_test.run();
    1.49 -  cout << "HUGO max matching algorithm on SageGraph by copying the graph, based on preflow." 
    1.50 +  cout << "LEMON max matching algorithm on SageGraph by copying the graph, based on preflow." 
    1.51  	    << endl 
    1.52  	    << "Size of matching: " 
    1.53  	    << max_flow_test.flowValue() << endl;