RhodeCode

#include <lemon/network_simplex.h>

template<class Value>

void solve_min(ArgParser &ap, std::istream &is, std::ostream &,

               DimacsDescriptor &desc)

{

  bool report = !ap.given("q");

  Digraph g;

  Digraph::ArcMap<Value> lower(g), cap(g), cost(g);

  Digraph::NodeMap<Value> sup(g);

  Timer ti;

  ti.restart();

  readDimacsMin(is, g, lower, cap, cost, sup, desc);

  if (report) std::cerr << "Read the file: " << ti << '\n';

  ti.restart();

  NetworkSimplex< Digraph, Digraph::ArcMap<Value>, Digraph::ArcMap<Value>,

                  Digraph::ArcMap<Value>, Digraph::NodeMap<Value> >

    ns(g, lower, cap, cost, sup);

  if (report) std::cerr << "Setup NetworkSimplex class: " << ti << '\n';

  ti.restart();

  ns.run();

  if (report) std::cerr << "Run NetworkSimplex: " << ti << '\n';

  if (report) std::cerr << "\nMin flow cost: " << ns.totalCost() << '\n';

}

      solve_min<Value>(ap,is,os,desc);