Changeset 921:818510fa3d99 in lemon-0.x for src/lemon/suurballe.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/lemon/suurballe.h (moved) (moved from src/hugo/suurballe.h) (6 diffs)

src/lemon/suurballe.h

@@ -1 +1 @@
 /* -*- C++ -*-
- * src/hugo/suurballe.h - Part of HUGOlib, a generic C++ optimization library
+ * src/lemon/suurballe.h - Part of LEMON, a generic C++ optimization library
  *
  * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
@@ -15 +15 @@
  */
 
-#ifndef HUGO_SUURBALLE_H
-#define HUGO_SUURBALLE_H
+#ifndef LEMON_SUURBALLE_H
+#define LEMON_SUURBALLE_H
 
 ///\ingroup flowalgs
@@ -23 +23 @@
 
 
-#include <hugo/maps.h>
+#include <lemon/maps.h>
 #include <vector>
-#include <hugo/min_cost_flow.h>
-
-namespace hugo {
+#include <lemon/min_cost_flow.h>
+
+namespace lemon {
 
 /// \addtogroup flowalgs
@@ -35 +35 @@
   /// of minimal total length 
   ///
-  /// The class \ref hugo::Suurballe implements
+  /// The class \ref lemon::Suurballe implements
   /// an algorithm for finding k edge-disjoint paths
   /// from a given source node to a given target node in an
@@ -188 +188 @@
     ///then the result here will be an empty path (\c j can be 0 as well).
     ///
-    ///\param Path The type of the path structure to put the result to (must meet hugo path concept).
+    ///\param Path The type of the path structure to put the result to (must meet lemon path concept).
     ///\param p The path to put the result to 
     ///\param j Which path you want to get from the found paths (in a real application you would get the found paths iteratively)
@@ -211 +211 @@
   ///@}
 
-} //namespace hugo
-
-#endif //HUGO_SUURBALLE_H
+} //namespace lemon
+
+#endif //LEMON_SUURBALLE_H