1.1 --- a/src/work/marci/leda/bipartite_matching_leda_gen.cc	Wed Sep 29 14:12:26 2004 +0000
     1.2 +++ b/src/work/marci/leda/bipartite_matching_leda_gen.cc	Wed Sep 29 15:30:04 2004 +0000
     1.3 @@ -13,12 +13,12 @@
     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  #include <augmenting_flow.h>
    1.18  
    1.19  /**
    1.20 @@ -43,7 +43,7 @@
    1.21    return int( double(m) * rand() / (RAND_MAX + 1.0) );
    1.22  }
    1.23  
    1.24 -using namespace hugo;
    1.25 +using namespace lemon;
    1.26  
    1.27  int main() {
    1.28    //for leda graph
    1.29 @@ -110,7 +110,7 @@
    1.30    MaxFlow<stGW, int, ConstMap<stGW::Edge, int>, stGW::EdgeMap<int> > 
    1.31      max_flow_test(stgw, stgw.S_NODE, stgw.T_NODE, const1map, flow/*, true*/);
    1.32    max_flow_test.run();
    1.33 -  std::cout << "HUGO max matching algorithm based on preflow." << std::endl 
    1.34 +  std::cout << "LEMON max matching algorithm based on preflow." << std::endl 
    1.35  	    << "Size of matching: " 
    1.36  	    << max_flow_test.flowValue() << std::endl;
    1.37    std::cout << "elapsed time: " << ts << std::endl << std::endl;
    1.38 @@ -129,7 +129,7 @@
    1.39    AugmentingFlow<stGW, int, ConstMap<stGW::Edge, int>, stGW::EdgeMap<int> > 
    1.40      max_flow_test_1(stgw, stgw.S_NODE, stgw.T_NODE, const1map, flow/*, true*/);
    1.41    while (max_flow_test_1.augmentOnBlockingFlow<MutableGraph>()) { }
    1.42 -  std::cout << "HUGO max matching algorithm based on blocking flow augmentation." 
    1.43 +  std::cout << "LEMON max matching algorithm based on blocking flow augmentation." 
    1.44  	    << std::endl << "Matching size: " 
    1.45  	    << max_flow_test_1.flowValue() << std::endl;
    1.46    std::cout << "elapsed time: " << ts << std::endl;