diff -r 2d6c8075d9d0 -r 818510fa3d99 src/work/athos/mincostflow.h
--- a/src/work/athos/mincostflow.h	Wed Sep 29 14:12:26 2004 +0000
+++ b/src/work/athos/mincostflow.h	Wed Sep 29 15:30:04 2004 +0000
@@ -1,23 +1,23 @@
 // -*- c++ -*-
-#ifndef HUGO_MINCOSTFLOW_H
-#define HUGO_MINCOSTFLOW_H
+#ifndef LEMON_MINCOSTFLOW_H
+#define LEMON_MINCOSTFLOW_H
 
 ///\ingroup galgs
 ///\file
 ///\brief An algorithm for finding the minimum cost flow of given value in an uncapacitated network
 
-#include <hugo/dijkstra.h>
-#include <hugo/graph_wrapper.h>
-#include <hugo/maps.h>
+#include <lemon/dijkstra.h>
+#include <lemon/graph_wrapper.h>
+#include <lemon/maps.h>
 #include <vector>
 #include <list>
 #include <values.h>
-#include <hugo/for_each_macros.h>
-#include <hugo/unionfind.h>
-#include <hugo/bin_heap.h>
+#include <lemon/for_each_macros.h>
+#include <lemon/unionfind.h>
+#include <lemon/bin_heap.h>
 #include <bfs_dfs.h>
 
-namespace hugo {
+namespace lemon {
 
 /// \addtogroup galgs
 /// @{
@@ -26,7 +26,7 @@
   /// flow problem in an uncapacitated network
   /// 
   ///
-  /// The class \ref hugo::MinCostFlow "MinCostFlow" implements
+  /// The class \ref lemon::MinCostFlow "MinCostFlow" implements
   /// an algorithm for solving the following general minimum cost flow problem>
   /// 
   ///
@@ -508,6 +508,6 @@
 
   ///@}
 
-} //namespace hugo
+} //namespace lemon
 
-#endif //HUGO_MINCOSTFLOW_H
+#endif //LEMON_MINCOSTFLOW_H