Changes in / [847:754272f20318:845:a5fc1e1e5039] in lemon-main
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
tools/dimacs-solver.cc
r846 r644 92 92 } 93 93 94 template<class Value , class LargeValue>94 template<class Value> 95 95 void solve_min(ArgParser &ap, std::istream &is, std::ostream &, 96 96 Value infty, DimacsDescriptor &desc) … … 128 128 std::cerr << "Run NetworkSimplex: " << ti << "\n\n"; 129 129 std::cerr << "Feasible flow: " << (res ? "found" : "not found") << '\n'; 130 if (res) std::cerr << "Min flow cost: " 131 << ns.template totalCost<LargeValue>() << '\n'; 130 if (res) std::cerr << "Min flow cost: " << ns.totalCost() << '\n'; 132 131 } 133 132 } … … 153 152 154 153 155 template<class Value , class LargeValue>154 template<class Value> 156 155 void solve(ArgParser &ap, std::istream &is, std::ostream &os, 157 156 DimacsDescriptor &desc) … … 171 170 { 172 171 case DimacsDescriptor::MIN: 173 solve_min<Value , LargeValue>(ap,is,os,infty,desc);172 solve_min<Value>(ap,is,os,infty,desc); 174 173 break; 175 174 case DimacsDescriptor::MAX: … … 266 265 267 266 if(ap.given("double")) 268 solve<double , double>(ap,is,os,desc);267 solve<double>(ap,is,os,desc); 269 268 else if(ap.given("ldouble")) 270 solve<long double , long double>(ap,is,os,desc);269 solve<long double>(ap,is,os,desc); 271 270 #ifdef LEMON_HAVE_LONG_LONG 272 271 else if(ap.given("long")) 273 solve<long long, long long>(ap,is,os,desc); 274 else solve<int, long long>(ap,is,os,desc); 275 #else 276 else solve<int, long>(ap,is,os,desc); 272 solve<long long>(ap,is,os,desc); 277 273 #endif 274 else solve<int>(ap,is,os,desc); 278 275 279 276 return 0;
Note: See TracChangeset
for help on using the changeset viewer.