Changeset 1295:02a403c305b9 in lemon0.x
 Timestamp:
 04/04/05 10:03:43 (18 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@1729
 Location:
 src/work/athos/lp
 Files:

 3 edited
Legend:
 Unmodified
 Added
 Removed

src/work/athos/lp/Makefile
r1263 r1295 15 15 16 16 lp_test: lp_test.o lp_base.o lp_solver_skeleton.o lp_glpk.o 17 g++o $@ $^ lglpk17 $(CXX) o $@ $^ lglpk 
src/work/athos/lp/lp_base.h
r1294 r1295 115 115 ///\e 116 116 enum SolutionType { 117 ///\e 117 ///Feasible solution has'n been found (but may exist). 118 119 ///\todo NOTFOUND might be a better name. 120 /// 118 121 UNDEFINED = 0, 119 /// \e122 ///The problem has no feasible solution 120 123 INFEASIBLE = 1, 121 /// \e124 ///Feasible solution found 122 125 FEASIBLE = 2, 123 ///\e 124 OPTIMAL = 3 126 ///Optimal solution exists and found 127 OPTIMAL = 3, 128 ///The cost function is unbounded 129 130 ///\todo Give a feasible solution and an infinite ray (and the 131 ///corresponding bases) 132 INFINITE = 4 125 133 }; 126 134 … … 352 360 const Value &upperBound() const { return _ub; } 353 361 ///\e 354 bool lowerBounded() const { return std::isfinite(_lb); } 355 ///\e 356 bool upperBounded() const { return std::isfinite(_ub); } 362 bool lowerBounded() const { 363 using namespace std; 364 return isfinite(_lb); 365 } 366 ///\e 367 bool upperBounded() const { 368 using namespace std; 369 return isfinite(_ub); 370 } 357 371 }; 358 372 
src/work/athos/lp/lp_test.cc
r1293 r1295 140 140 typedef typename G::InEdgeIt InEdgeIt; 141 141 142 typename G:: EdgeMap<LpGlpk::Col> x(g);142 typename G::template EdgeMap<LpGlpk::Col> x(g); 143 143 lp.addColSet(x); 144 144
Note: See TracChangeset
for help on using the changeset viewer.