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

Timestamp:

09/29/04 17:30:04 (20 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/old/minlengthpaths.h (modified) (4 diffs)

src/work/athos/old/minlengthpaths.h

@@ -1 +1 @@
 // -*- c++ -*-
-#ifndef HUGO_MINLENGTHPATHS_H
-#define HUGO_MINLENGTHPATHS_H
+#ifndef LEMON_MINLENGTHPATHS_H
+#define LEMON_MINLENGTHPATHS_H
 
 ///\ingroup galgs
@@ -8 +8 @@
 
 #include <iostream>
-#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>
 
 
-namespace hugo {
+namespace lemon {
 
 /// \addtogroup galgs
@@ -22 +22 @@
   /// of minimal total length 
   ///
-  /// The class \ref hugo::MinLengthPaths "MinLengthPaths" implements
+  /// The class \ref lemon::MinLengthPaths "MinLengthPaths" implements
   /// an algorithm for finding k edge-disjoint paths
   /// from a given source node to a given target node in an
@@ -198 +198 @@
   ///@}
 
-} //namespace hugo
-
-#endif //HUGO_MINLENGTHPATHS_H
+} //namespace lemon
+
+#endif //LEMON_MINLENGTHPATHS_H