Changeset 921:818510fa3d99 in lemon0.x for src/work/marci/lp
 Timestamp:
 09/29/04 17:30:04 (18 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@1232
 Location:
 src/work/marci/lp
 Files:

 2 edited
Legend:
 Unmodified
 Added
 Removed

src/work/marci/lp/lp_solver_wrapper.h
r888 r921 1 1 // * c++ * 2 #ifndef HUGO_LP_SOLVER_WRAPPER_H3 #define HUGO_LP_SOLVER_WRAPPER2 #ifndef LEMON_LP_SOLVER_WRAPPER_H 3 #define LEMON_LP_SOLVER_WRAPPER 4 4 5 5 ///\ingroup misc … … 21 21 22 22 //#include <sage_graph.h> 23 //#include < hugo/list_graph.h>24 //#include < hugo/graph_wrapper.h>25 #include < hugo/invalid.h>23 //#include <lemon/list_graph.h> 24 //#include <lemon/graph_wrapper.h> 25 #include <lemon/invalid.h> 26 26 //#include <bfs_dfs.h> 27 27 //#include <stp.h> 28 //#include < hugo/max_flow.h>28 //#include <lemon/max_flow.h> 29 29 //#include <augmenting_flow.h> 30 30 //#include <iter_map.h> … … 34 34 using std::endl; 35 35 36 namespace hugo{36 namespace lemon { 37 37 38 38 … … 45 45 /// stl vector, the range is partitioned into sets and each set is 46 46 /// doubly linked in a list. 47 /// That is, each class is iterable by hugoiterators, and any member of47 /// That is, each class is iterable by lemon iterators, and any member of 48 48 /// the vector can bo moved to an other class. 49 49 template <typename T> … … 64 64 /// The classes are indexed by integers from \c 0 to \c classNum()1. 65 65 int classNum() const { return tips.size(); } 66 /// This hugostyle iterator iterates through a class.66 /// This lemon style iterator iterates through a class. 67 67 class ClassIt; 68 68 /// Constructor. The number of classes is to be given which is fixed … … 158 158 /// \brief Wrappers for LP solvers 159 159 /// 160 /// This class implements a hugowrapper for glpk.161 /// Later other LPsolvers will be wrapped into hugo.160 /// This class implements a lemon wrapper for glpk. 161 /// Later other LPsolvers will be wrapped into lemon. 162 162 /// The aim of this class is to give a general surface to different 163 163 /// solvers, i.e. it makes possible to write algorithms using LP's, … … 425 425 /// @} 426 426 427 } //namespace hugo428 429 #endif // HUGO_LP_SOLVER_WRAPPER_H427 } //namespace lemon 428 429 #endif //LEMON_LP_SOLVER_WRAPPER_H 
src/work/marci/lp/max_flow_by_lp.cc
r764 r921 4 4 5 5 #include <sage_graph.h> 6 #include < hugo/smart_graph.h>7 #include < hugo/dimacs.h>8 #include < hugo/time_measure.h>6 #include <lemon/smart_graph.h> 7 #include <lemon/dimacs.h> 8 #include <lemon/time_measure.h> 9 9 //#include <graph_wrapper.h> 10 #include < hugo/max_flow.h>10 #include <lemon/max_flow.h> 11 11 #include <augmenting_flow.h> 12 12 //#include <preflow_res.h> … … 14 14 #include <lp_solver_wrapper.h> 15 15 16 using namespace hugo;16 using namespace lemon; 17 17 18 18 // Use a DIMACS max flow file as stdin.
Note: See TracChangeset
for help on using the changeset viewer.