| ... | ... |
@@ -93,3 +93,3 @@ |
| 93 | 93 |
|
| 94 |
template<class Value> |
|
| 94 |
template<class Value, class LargeValue> |
|
| 95 | 95 |
void solve_min(ArgParser &ap, std::istream &is, std::ostream &, |
| ... | ... |
@@ -129,3 +129,4 @@ |
| 129 | 129 |
std::cerr << "Feasible flow: " << (res ? "found" : "not found") << '\n'; |
| 130 |
if (res) std::cerr << "Min flow cost: " |
|
| 130 |
if (res) std::cerr << "Min flow cost: " |
|
| 131 |
<< ns.template totalCost<LargeValue>() << '\n'; |
|
| 131 | 132 |
} |
| ... | ... |
@@ -153,3 +154,3 @@ |
| 153 | 154 |
|
| 154 |
template<class Value> |
|
| 155 |
template<class Value, class LargeValue> |
|
| 155 | 156 |
void solve(ArgParser &ap, std::istream &is, std::ostream &os, |
| ... | ... |
@@ -171,3 +172,3 @@ |
| 171 | 172 |
case DimacsDescriptor::MIN: |
| 172 |
solve_min<Value>(ap,is,os,infty,desc); |
|
| 173 |
solve_min<Value, LargeValue>(ap,is,os,infty,desc); |
|
| 173 | 174 |
break; |
| ... | ... |
@@ -266,10 +267,12 @@ |
| 266 | 267 |
if(ap.given("double"))
|
| 267 |
solve<double>(ap,is,os,desc); |
|
| 268 |
solve<double, double>(ap,is,os,desc); |
|
| 268 | 269 |
else if(ap.given("ldouble"))
|
| 269 |
solve<long double>(ap,is,os,desc); |
|
| 270 |
solve<long double, long double>(ap,is,os,desc); |
|
| 270 | 271 |
#ifdef LEMON_HAVE_LONG_LONG |
| 271 | 272 |
else if(ap.given("long"))
|
| 272 |
solve<long long>(ap,is,os,desc); |
|
| 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); |
|
| 273 | 277 |
#endif |
| 274 |
else solve<int>(ap,is,os,desc); |
|
| 275 | 278 |
|
0 comments (0 inline)