1.1 --- a/src/work/marci/leda/bipartite_matching_leda.cc	Wed Sep 29 14:12:26 2004 +0000
     1.2 +++ b/src/work/marci/leda/bipartite_matching_leda.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  
    1.18  /**
    1.19   * Inicializalja a veletlenszamgeneratort.
    1.20 @@ -42,7 +42,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