Changeset 921:818510fa3d99 in lemon-0.x for src/work/marci/lp

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

Location:

src/work/marci/lp

Files:

• lp_solver_wrapper.h (modified) (7 diffs)
• max_flow_by_lp.cc (modified) (2 diffs)

src/work/marci/lp/lp_solver_wrapper.h

@@ -1 +1 @@
 // -*- c++ -*-
-#ifndef HUGO_LP_SOLVER_WRAPPER_H
-#define HUGO_LP_SOLVER_WRAPPER
+#ifndef LEMON_LP_SOLVER_WRAPPER_H
+#define LEMON_LP_SOLVER_WRAPPER
 
 ///\ingroup misc
@@ -21 +21 @@
 
 //#include <sage_graph.h>
-//#include <hugo/list_graph.h>
-//#include <hugo/graph_wrapper.h>
-#include <hugo/invalid.h>
+//#include <lemon/list_graph.h>
+//#include <lemon/graph_wrapper.h>
+#include <lemon/invalid.h>
 //#include <bfs_dfs.h>
 //#include <stp.h>
-//#include <hugo/max_flow.h>
+//#include <lemon/max_flow.h>
 //#include <augmenting_flow.h>
 //#include <iter_map.h>
@@ -34 +34 @@
 using std::endl;
 
-namespace hugo {
+namespace lemon {
 
   
@@ -45 +45 @@
   /// stl vector, the range is partitioned into sets and each set is 
   /// doubly linked in a list. 
-  /// That is, each class is iterable by hugo iterators, and any member of 
+  /// That is, each class is iterable by lemon iterators, and any member of 
   /// the vector can bo moved to an other class.
   template <typename T>
@@ -64 +64 @@
     /// The classes are indexed by integers from \c 0 to \c classNum()-1.
     int classNum() const { return tips.size(); }
-    /// This hugo style iterator iterates through a class. 
+    /// This lemon style iterator iterates through a class. 
     class ClassIt;
     /// Constructor. The number of classes is to be given which is fixed 
@@ -158 +158 @@
   /// \brief Wrappers for LP solvers
   /// 
-  /// This class implements a hugo wrapper for glpk.
-  /// Later other LP-solvers will be wrapped into hugo.
+  /// This class implements a lemon wrapper for glpk.
+  /// Later other LP-solvers will be wrapped into lemon.
   /// The aim of this class is to give a general surface to different 
   /// solvers, i.e. it makes possible to write algorithms using LP's, 
@@ -425 +425 @@
   /// @}
 
-} //namespace hugo
-
-#endif //HUGO_LP_SOLVER_WRAPPER_H
+} //namespace lemon
+
+#endif //LEMON_LP_SOLVER_WRAPPER_H

src/work/marci/lp/max_flow_by_lp.cc

@@ -4 +4 @@
 
 #include <sage_graph.h>
-#include <hugo/smart_graph.h>
-#include <hugo/dimacs.h>
-#include <hugo/time_measure.h>
+#include <lemon/smart_graph.h>
+#include <lemon/dimacs.h>
+#include <lemon/time_measure.h>
 //#include <graph_wrapper.h>
-#include <hugo/max_flow.h>
+#include <lemon/max_flow.h>
 #include <augmenting_flow.h>
 //#include <preflow_res.h>
@@ -14 +14 @@
 #include <lp_solver_wrapper.h>
 
-using namespace hugo;
+using namespace lemon;
 
 // Use a DIMACS max flow file as stdin.