Changeset 921:818510fa3d99 in lemon-0.x for src/work/athos/mincostflow.h

Timestamp:

09/29/04 17:30:04 (21 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1232

Message:

hugo -> lemon

File:

• src/work/athos/mincostflow.h (modified) (4 diffs)

src/work/athos/mincostflow.h

@@ -1 +1 @@
 // -*- c++ -*-
-#ifndef HUGO_MINCOSTFLOW_H
-#define HUGO_MINCOSTFLOW_H
+#ifndef LEMON_MINCOSTFLOW_H
+#define LEMON_MINCOSTFLOW_H
 
 ///\ingroup galgs
@@ -7 +7 @@
 ///\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
@@ -27 +27 @@
   /// 
   ///
-  /// 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>
   /// 
@@ -509 +509 @@
   ///@}
 
-} //namespace hugo
-
-#endif //HUGO_MINCOSTFLOW_H
+} //namespace lemon
+
+#endif //LEMON_MINCOSTFLOW_H