1.1 --- a/src/work/athos/mincostflow.h	Wed Sep 29 14:12:26 2004 +0000
     1.2 +++ b/src/work/athos/mincostflow.h	Wed Sep 29 15:30:04 2004 +0000
     1.3 @@ -1,23 +1,23 @@
     1.4  // -*- c++ -*-
     1.5 -#ifndef HUGO_MINCOSTFLOW_H
     1.6 -#define HUGO_MINCOSTFLOW_H
     1.7 +#ifndef LEMON_MINCOSTFLOW_H
     1.8 +#define LEMON_MINCOSTFLOW_H
     1.9  
    1.10  ///\ingroup galgs
    1.11  ///\file
    1.12  ///\brief An algorithm for finding the minimum cost flow of given value in an uncapacitated network
    1.13  
    1.14 -#include <hugo/dijkstra.h>
    1.15 -#include <hugo/graph_wrapper.h>
    1.16 -#include <hugo/maps.h>
    1.17 +#include <lemon/dijkstra.h>
    1.18 +#include <lemon/graph_wrapper.h>
    1.19 +#include <lemon/maps.h>
    1.20  #include <vector>
    1.21  #include <list>
    1.22  #include <values.h>
    1.23 -#include <hugo/for_each_macros.h>
    1.24 -#include <hugo/unionfind.h>
    1.25 -#include <hugo/bin_heap.h>
    1.26 +#include <lemon/for_each_macros.h>
    1.27 +#include <lemon/unionfind.h>
    1.28 +#include <lemon/bin_heap.h>
    1.29  #include <bfs_dfs.h>
    1.30  
    1.31 -namespace hugo {
    1.32 +namespace lemon {
    1.33  
    1.34  /// \addtogroup galgs
    1.35  /// @{
    1.36 @@ -26,7 +26,7 @@
    1.37    /// flow problem in an uncapacitated network
    1.38    /// 
    1.39    ///
    1.40 -  /// The class \ref hugo::MinCostFlow "MinCostFlow" implements
    1.41 +  /// The class \ref lemon::MinCostFlow "MinCostFlow" implements
    1.42    /// an algorithm for solving the following general minimum cost flow problem>
    1.43    /// 
    1.44    ///
    1.45 @@ -508,6 +508,6 @@
    1.46  
    1.47    ///@}
    1.48  
    1.49 -} //namespace hugo
    1.50 +} //namespace lemon
    1.51  
    1.52 -#endif //HUGO_MINCOSTFLOW_H
    1.53 +#endif //LEMON_MINCOSTFLOW_H