COIN-OR::LEMON - Graph Library

Changes in / [847:754272f20318:845:a5fc1e1e5039] in lemon-main


Ignore:
File:
1 edited

Legend:

Unmodified
Added
Removed
  • tools/dimacs-solver.cc

    r846 r644  
    9292}
    9393
    94 template<class Value, class LargeValue>
     94template<class Value>
    9595void solve_min(ArgParser &ap, std::istream &is, std::ostream &,
    9696               Value infty, DimacsDescriptor &desc)
     
    128128    std::cerr << "Run NetworkSimplex: " << ti << "\n\n";
    129129    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';
    132131  }
    133132}
     
    153152
    154153
    155 template<class Value, class LargeValue>
     154template<class Value>
    156155void solve(ArgParser &ap, std::istream &is, std::ostream &os,
    157156           DimacsDescriptor &desc)
     
    171170    {
    172171    case DimacsDescriptor::MIN:
    173       solve_min<Value, LargeValue>(ap,is,os,infty,desc);
     172      solve_min<Value>(ap,is,os,infty,desc);
    174173      break;
    175174    case DimacsDescriptor::MAX:
     
    266265   
    267266  if(ap.given("double"))
    268     solve<double, double>(ap,is,os,desc);
     267    solve<double>(ap,is,os,desc);
    269268  else if(ap.given("ldouble"))
    270     solve<long double, long double>(ap,is,os,desc);
     269    solve<long double>(ap,is,os,desc);
    271270#ifdef LEMON_HAVE_LONG_LONG
    272271  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);
    277273#endif
     274  else solve<int>(ap,is,os,desc);
    278275
    279276  return 0;
Note: See TracChangeset for help on using the changeset viewer.