1.1 --- a/src/work/marci/max_bipartite_matching.h	Wed Sep 29 14:12:26 2004 +0000
     1.2 +++ b/src/work/marci/max_bipartite_matching.h	Wed Sep 29 15:30:04 2004 +0000
     1.3 @@ -1,6 +1,6 @@
     1.4  // -*- c++ -*-
     1.5 -#ifndef HUGO_MAX_BIPARTITE_MATCHING_H
     1.6 -#define HUGO_MAX_BIPARTITE_MATCHING_H
     1.7 +#ifndef LEMON_MAX_BIPARTITE_MATCHING_H
     1.8 +#define LEMON_MAX_BIPARTITE_MATCHING_H
     1.9  
    1.10  /// \ingroup galgs
    1.11  /// \file
    1.12 @@ -14,10 +14,10 @@
    1.13  
    1.14  //#include <for_each_macros.h>
    1.15  #include <bipartite_graph_wrapper.h>
    1.16 -//#include <hugo/maps.h>
    1.17 -#include <hugo/max_flow.h>
    1.18 +//#include <lemon/maps.h>
    1.19 +#include <lemon/max_flow.h>
    1.20  
    1.21 -namespace hugo {
    1.22 +namespace lemon {
    1.23  
    1.24    // template <typename Graph, typename EdgeCap, typename NodeCap, 
    1.25    // 	  typename EdgeFlow, typename NodeFlow>
    1.26 @@ -135,6 +135,6 @@
    1.27      int matchingValue() const { return mf.flowValue(); }
    1.28    };
    1.29  
    1.30 -} //namespace hugo
    1.31 +} //namespace lemon
    1.32  
    1.33 -#endif //HUGO_MAX_BIPARTITE_MATCHING_H
    1.34 +#endif //LEMON_MAX_BIPARTITE_MATCHING_H