RhodeCode

EXTRA_DIST += \

	lemon/lemon.pc.in \

	lemon/CMakeLists.txt

pkgconfig_DATA += lemon/lemon.pc

lib_LTLIBRARIES += lemon/libemon.la

lemon_libemon_la_SOURCES = \

	lemon/arg_parser.cc \

	lemon/base.cc \

	lemon/color.cc \

	lemon/lp_base.cc \

	lemon/lp_skeleton.cc \

	lemon/random.cc \

	lemon/bits/windows.cc

lemon_libemon_la_CXXFLAGS = \

	$(AM_CXXFLAGS) \

	$(GLPK_CFLAGS) \

	$(CPLEX_CFLAGS) \

	$(SOPLEX_CXXFLAGS) \

	$(CLP_CXXFLAGS) \

	$(CBC_CXXFLAGS)

lemon_libemon_la_LDFLAGS = \

	$(GLPK_LIBS) \

	$(CPLEX_LIBS) \

	$(SOPLEX_LIBS) \

	$(CLP_LIBS) \

	$(CBC_LIBS)

if HAVE_GLPK

lemon_libemon_la_SOURCES += lemon/glpk.cc

endif

if HAVE_CPLEX

lemon_libemon_la_SOURCES += lemon/cplex.cc

endif

if HAVE_SOPLEX

lemon_libemon_la_SOURCES += lemon/soplex.cc

endif

if HAVE_CLP

lemon_libemon_la_SOURCES += lemon/clp.cc

endif

if HAVE_CBC

lemon_libemon_la_SOURCES += lemon/cbc.cc

endif

lemon_HEADERS += \

	lemon/adaptors.h \

	lemon/arg_parser.h \

	lemon/assert.h \

	lemon/bfs.h \

	lemon/bin_heap.h \

	lemon/circulation.h \

	lemon/clp.h \

	lemon/color.h \

	lemon/concept_check.h \

	lemon/connectivity.h \

	lemon/counter.h \

	lemon/core.h \

	lemon/cplex.h \

	lemon/dfs.h \

	lemon/dijkstra.h \

	lemon/dim2.h \

	lemon/dimacs.h \

	lemon/edge_set.h \

	lemon/elevator.h \

	lemon/error.h \

	lemon/euler.h \

	lemon/full_graph.h \

	lemon/glpk.h \

	lemon/gomory_hu.h \

	lemon/graph_to_eps.h \

	lemon/grid_graph.h \

	lemon/hypercube_graph.h \

	lemon/kruskal.h \

	lemon/hao_orlin.h \

	lemon/lgf_reader.h \

	lemon/lgf_writer.h \

	lemon/list_graph.h \

	lemon/lp.h \

	lemon/lp_base.h \

	lemon/lp_skeleton.h \

	lemon/list_graph.h \

	lemon/maps.h \

	lemon/math.h \

	lemon/min_cost_arborescence.h \

	lemon/nauty_reader.h \

	lemon/path.h \

	lemon/preflow.h \

	lemon/radix_sort.h \

	lemon/random.h \

	lemon/smart_graph.h \

	lemon/soplex.h \

	lemon/suurballe.h \

	lemon/time_measure.h \

	lemon/tolerance.h \

	lemon/unionfind.h \

	lemon/bits/windows.h

bits_HEADERS += \

	lemon/bits/alteration_notifier.h \

	lemon/bits/array_map.h \

	lemon/bits/base_extender.h \

	lemon/bits/bezier.h \

	lemon/bits/default_map.h \

	lemon/bits/edge_set_extender.h \

	lemon/bits/enable_if.h \

	lemon/bits/graph_adaptor_extender.h \

	lemon/bits/graph_extender.h \

	lemon/bits/map_extender.h \

	lemon/bits/path_dump.h \

	lemon/bits/solver_bits.h \

	lemon/bits/traits.h \

	lemon/bits/variant.h \

	lemon/bits/vector_map.h

concept_HEADERS += \

	lemon/concepts/digraph.h \

	lemon/concepts/graph.h \

	lemon/concepts/graph_components.h \

	lemon/concepts/heap.h \

	lemon/concepts/maps.h \

	lemon/concepts/path.h

INCLUDE_DIRECTORIES(

  ${PROJECT_SOURCE_DIR}

  ${PROJECT_BINARY_DIR}

)

IF(HAVE_GLPK)

  INCLUDE_DIRECTORIES(${GLPK_INCLUDE_DIR})

ENDIF(HAVE_GLPK)

LINK_DIRECTORIES(${PROJECT_BINARY_DIR}/lemon)

SET(TESTS

  adaptors_test

  bfs_test

  circulation_test

  counter_test

  dfs_test

  digraph_test

  dijkstra_test

  dim_test

  edge_set_test

  error_test

  euler_test

  gomory_hu_test

  graph_copy_test

  graph_test

  graph_utils_test

  hao_orlin_test

  heap_test

  kruskal_test

  maps_test

  min_cost_arborescence_test

  path_test

  preflow_test

  radix_sort_test

  random_test

  suurballe_test

  time_measure_test

  unionfind_test)

IF(HAVE_LP)

  ADD_EXECUTABLE(lp_test lp_test.cc)

  IF(HAVE_GLPK)

    TARGET_LINK_LIBRARIES(lp_test lemon ${GLPK_LIBRARIES})

  ENDIF(HAVE_GLPK)

  ADD_TEST(lp_test lp_test)

  IF(WIN32 AND HAVE_GLPK)

    GET_TARGET_PROPERTY(TARGET_LOC lp_test LOCATION)

    GET_FILENAME_COMPONENT(TARGET_PATH ${TARGET_LOC} PATH)

    ADD_CUSTOM_COMMAND(TARGET lp_test POST_BUILD

      COMMAND cmake -E copy ${GLPK_BIN_DIR}/glpk.dll ${TARGET_PATH}

      COMMAND cmake -E copy ${GLPK_BIN_DIR}/libltdl3.dll ${TARGET_PATH}

      COMMAND cmake -E copy ${GLPK_BIN_DIR}/zlib1.dll ${TARGET_PATH}

    )

  ENDIF(WIN32 AND HAVE_GLPK)

ENDIF(HAVE_LP)

IF(HAVE_MIP)

  ADD_EXECUTABLE(mip_test mip_test.cc)

  IF(HAVE_GLPK)

    TARGET_LINK_LIBRARIES(mip_test lemon ${GLPK_LIBRARIES})

  ENDIF(HAVE_GLPK)

  ADD_TEST(mip_test mip_test)

  IF(WIN32 AND HAVE_GLPK)

    GET_TARGET_PROPERTY(TARGET_LOC mip_test LOCATION)

    GET_FILENAME_COMPONENT(TARGET_PATH ${TARGET_LOC} PATH)

    ADD_CUSTOM_COMMAND(TARGET mip_test POST_BUILD

      COMMAND cmake -E copy ${GLPK_BIN_DIR}/glpk.dll ${TARGET_PATH}

      COMMAND cmake -E copy ${GLPK_BIN_DIR}/libltdl3.dll ${TARGET_PATH}

      COMMAND cmake -E copy ${GLPK_BIN_DIR}/zlib1.dll ${TARGET_PATH}

    )

  ENDIF(WIN32 AND HAVE_GLPK)

ENDIF(HAVE_MIP)

FOREACH(TEST_NAME ${TESTS})

  ADD_EXECUTABLE(${TEST_NAME} ${TEST_NAME}.cc)

  TARGET_LINK_LIBRARIES(${TEST_NAME} lemon)

  ADD_TEST(${TEST_NAME} ${TEST_NAME})

ENDFOREACH(TEST_NAME)

EXTRA_DIST += \

	test/CMakeLists.txt

noinst_HEADERS += \

	test/graph_test.h \

	test/test_tools.h

check_PROGRAMS += \

	test/adaptors_test \

	test/bfs_test \

	test/circulation_test \

	test/counter_test \

	test/dfs_test \

	test/digraph_test \

	test/dijkstra_test \

	test/dim_test \

	test/edge_set_test \

	test/error_test \

	test/euler_test \

	test/gomory_hu_test \

	test/graph_copy_test \

	test/graph_test \

	test/graph_utils_test \

	test/hao_orlin_test \

	test/heap_test \

	test/kruskal_test \

	test/maps_test \

	test/min_cost_arborescence_test \

	test/path_test \

	test/preflow_test \

	test/radix_sort_test \

	test/random_test \

	test/suurballe_test \

	test/test_tools_fail \

	test/test_tools_pass \

	test/time_measure_test \

	test/unionfind_test

test_test_tools_pass_DEPENDENCIES = demo

if HAVE_LP

check_PROGRAMS += test/lp_test

endif HAVE_LP

if HAVE_MIP

check_PROGRAMS += test/mip_test

endif HAVE_MIP

TESTS += $(check_PROGRAMS)

XFAIL_TESTS += test/test_tools_fail$(EXEEXT)

test_adaptors_test_SOURCES = test/adaptors_test.cc

test_bfs_test_SOURCES = test/bfs_test.cc

test_circulation_test_SOURCES = test/circulation_test.cc

test_counter_test_SOURCES = test/counter_test.cc

test_dfs_test_SOURCES = test/dfs_test.cc

test_digraph_test_SOURCES = test/digraph_test.cc

test_dijkstra_test_SOURCES = test/dijkstra_test.cc

test_dim_test_SOURCES = test/dim_test.cc

test_edge_set_test_SOURCES = test/edge_set_test.cc

test_error_test_SOURCES = test/error_test.cc

test_euler_test_SOURCES = test/euler_test.cc

test_gomory_hu_test_SOURCES = test/gomory_hu_test.cc

test_graph_copy_test_SOURCES = test/graph_copy_test.cc

test_graph_test_SOURCES = test/graph_test.cc

test_graph_utils_test_SOURCES = test/graph_utils_test.cc

test_heap_test_SOURCES = test/heap_test.cc

test_kruskal_test_SOURCES = test/kruskal_test.cc

test_hao_orlin_test_SOURCES = test/hao_orlin_test.cc

test_lp_test_SOURCES = test/lp_test.cc

test_maps_test_SOURCES = test/maps_test.cc

test_mip_test_SOURCES = test/mip_test.cc

test_min_cost_arborescence_test_SOURCES = test/min_cost_arborescence_test.cc

test_path_test_SOURCES = test/path_test.cc

test_preflow_test_SOURCES = test/preflow_test.cc

test_radix_sort_test_SOURCES = test/radix_sort_test.cc

test_suurballe_test_SOURCES = test/suurballe_test.cc

test_random_test_SOURCES = test/random_test.cc

test_test_tools_fail_SOURCES = test/test_tools_fail.cc

test_test_tools_pass_SOURCES = test/test_tools_pass.cc

test_time_measure_test_SOURCES = test/time_measure_test.cc

test_unionfind_test_SOURCES = test/unionfind_test.cc

/* -*- mode: C++; indent-tabs-mode: nil; -*-

 *

 * This file is a part of LEMON, a generic C++ optimization library.

 *

 * Copyright (C) 2003-2009

 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

 * (Egervary Research Group on Combinatorial Optimization, EGRES).

 *

 * Permission to use, modify and distribute this software is granted

 * provided that this copyright notice appears in all copies. For

 * precise terms see the accompanying LICENSE file.

 *

 * This software is provided "AS IS" with no warranty of any kind,

 * express or implied, and with no claim as to its suitability for any

 * purpose.

 *

 */

#include <iostream>

#include <sstream>

#include <vector>

#include <queue>

#include <cstdlib>

#include <lemon/smart_graph.h>

#include <lemon/concepts/graph.h>

#include <lemon/concepts/maps.h>

#include <lemon/lgf_reader.h>

#include <lemon/math.h>

#include "test_tools.h"

using namespace std;

using namespace lemon;

GRAPH_TYPEDEFS(SmartGraph);

const int lgfn = 3;

const std::string lgf[lgfn] = {

  "@nodes\n"

  "label\n"

  "0\n"

  "1\n"

  "2\n"

  "3\n"

  "4\n"

  "5\n"

  "6\n"

  "7\n"

  "@edges\n"

  "     label  weight\n"

  "7 4  0      984\n"

  "0 7  1      73\n"

  "7 1  2      204\n"

  "2 3  3      583\n"

  "2 7  4      565\n"

  "2 1  5      582\n"

  "0 4  6      551\n"

  "2 5  7      385\n"

  "1 5  8      561\n"

  "5 3  9      484\n"

  "7 5  10     904\n"

  "3 6  11     47\n"

  "7 6  12     888\n"

  "3 0  13     747\n"

  "6 1  14     310\n",

  "@nodes\n"

  "label\n"

  "0\n"

  "1\n"

  "2\n"

  "3\n"

  "4\n"

  "5\n"

  "6\n"

  "7\n"

  "@edges\n"

  "     label  weight\n"

  "2 5  0      710\n"

  "0 5  1      241\n"

  "2 4  2      856\n"

  "2 6  3      762\n"

  "4 1  4      747\n"

  "6 1  5      962\n"

  "4 7  6      723\n"

  "1 7  7      661\n"

  "2 3  8      376\n"

  "1 0  9      416\n"

  "6 7  10     391\n",

  "@nodes\n"

  "label\n"

  "0\n"

  "1\n"

  "2\n"

  "3\n"

  "4\n"

  "5\n"

  "6\n"

  "7\n"

  "@edges\n"

  "     label  weight\n"

  "6 2  0      553\n"

  "0 7  1      653\n"

  "6 3  2      22\n"

  "4 7  3      846\n"

  "7 2  4      981\n"

  "7 6  5      250\n"

  "5 2  6      539\n",

};

void checkMaxMatchingCompile()

{

  typedef concepts::Graph Graph;

  typedef Graph::Node Node;

  typedef Graph::Edge Edge;

  typedef Graph::EdgeMap<bool> MatMap;

  Graph g;

  Node n;

  Edge e;

  MatMap mat(g);

  MaxMatching<Graph> mat_test(g);

  const MaxMatching<Graph>&

    const_mat_test = mat_test;

  mat_test.init();

  mat_test.greedyInit();

  mat_test.matchingInit(mat);

  mat_test.startSparse();

  mat_test.startDense();

  mat_test.run();

  const_mat_test.matchingSize();

  const_mat_test.matching(e);

  const_mat_test.matching(n);

  const MaxMatching<Graph>::MatchingMap& mmap =

    const_mat_test.matchingMap();

  e = mmap[n];

  const_mat_test.mate(n);

  MaxMatching<Graph>::Status stat = 

    const_mat_test.status(n);

  const MaxMatching<Graph>::StatusMap& smap =

    const_mat_test.statusMap();

  stat = smap[n];

  const_mat_test.barrier(n);

}

void checkMaxWeightedMatchingCompile()

{

  typedef concepts::Graph Graph;

  typedef Graph::Node Node;

  typedef Graph::Edge Edge;

  typedef Graph::EdgeMap<int> WeightMap;

  Graph g;

  Node n;

  Edge e;

  WeightMap w(g);

  MaxWeightedMatching<Graph> mat_test(g, w);

  const MaxWeightedMatching<Graph>&

    const_mat_test = mat_test;

  mat_test.init();

  mat_test.start();

  mat_test.run();

  const_mat_test.matchingWeight();

  const_mat_test.matchingSize();

  const_mat_test.matching(e);

  const_mat_test.matching(n);

  const MaxWeightedMatching<Graph>::MatchingMap& mmap =

    const_mat_test.matchingMap();

  e = mmap[n];

  const_mat_test.mate(n);

  int k = 0;

  const_mat_test.dualValue();

  const_mat_test.nodeValue(n);

  const_mat_test.blossomNum();

  const_mat_test.blossomSize(k);

  const_mat_test.blossomValue(k);

}

void checkMaxWeightedPerfectMatchingCompile()

{

  typedef concepts::Graph Graph;

  typedef Graph::Node Node;

  typedef Graph::Edge Edge;

  typedef Graph::EdgeMap<int> WeightMap;

  Graph g;

  Node n;

  Edge e;

  WeightMap w(g);

  MaxWeightedPerfectMatching<Graph> mat_test(g, w);

  const MaxWeightedPerfectMatching<Graph>&

    const_mat_test = mat_test;

  mat_test.init();

  mat_test.start();

  mat_test.run();

  const_mat_test.matchingWeight();

  const_mat_test.matching(e);

  const_mat_test.matching(n);

  const MaxWeightedPerfectMatching<Graph>::MatchingMap& mmap =

    const_mat_test.matchingMap();

  e = mmap[n];

  const_mat_test.mate(n);

  int k = 0;

  const_mat_test.dualValue();

  const_mat_test.nodeValue(n);

  const_mat_test.blossomNum();

  const_mat_test.blossomSize(k);

  const_mat_test.blossomValue(k);

}

void checkMatching(const SmartGraph& graph,

                   const MaxMatching<SmartGraph>& mm) {

  int num = 0;

  IntNodeMap comp_index(graph);

  UnionFind<IntNodeMap> comp(comp_index);

  int barrier_num = 0;

  for (NodeIt n(graph); n != INVALID; ++n) {

    check(mm.status(n) == MaxMatching<SmartGraph>::EVEN ||

          mm.matching(n) != INVALID, "Wrong Gallai-Edmonds decomposition");

    if (mm.status(n) == MaxMatching<SmartGraph>::ODD) {

      ++barrier_num;

    } else {

      comp.insert(n);

    }

  }

  for (EdgeIt e(graph); e != INVALID; ++e) {

    if (mm.matching(e)) {

      check(e == mm.matching(graph.u(e)), "Wrong matching");

      check(e == mm.matching(graph.v(e)), "Wrong matching");

      ++num;

    }

    check(mm.status(graph.u(e)) != MaxMatching<SmartGraph>::EVEN ||

          mm.status(graph.v(e)) != MaxMatching<SmartGraph>::MATCHED,

          "Wrong Gallai-Edmonds decomposition");

    check(mm.status(graph.v(e)) != MaxMatching<SmartGraph>::EVEN ||

          mm.status(graph.u(e)) != MaxMatching<SmartGraph>::MATCHED,

          "Wrong Gallai-Edmonds decomposition");

    if (mm.status(graph.u(e)) != MaxMatching<SmartGraph>::ODD &&

        mm.status(graph.v(e)) != MaxMatching<SmartGraph>::ODD) {

      comp.join(graph.u(e), graph.v(e));

    }

  }

  std::set<int> comp_root;

  int odd_comp_num = 0;

  for (NodeIt n(graph); n != INVALID; ++n) {

    if (mm.status(n) != MaxMatching<SmartGraph>::ODD) {

      int root = comp.find(n);

      if (comp_root.find(root) == comp_root.end()) {

        comp_root.insert(root);

        if (comp.size(n) % 2 == 1) {

          ++odd_comp_num;

        }

      }

    }

  }

  check(mm.matchingSize() == num, "Wrong matching");

  check(2 * num == countNodes(graph) - (odd_comp_num - barrier_num),

         "Wrong matching");

  return;

}

void checkWeightedMatching(const SmartGraph& graph,

                   const SmartGraph::EdgeMap<int>& weight,

                   const MaxWeightedMatching<SmartGraph>& mwm) {

  for (SmartGraph::EdgeIt e(graph); e != INVALID; ++e) {

    if (graph.u(e) == graph.v(e)) continue;

    int rw = mwm.nodeValue(graph.u(e)) + mwm.nodeValue(graph.v(e));

    for (int i = 0; i < mwm.blossomNum(); ++i) {

      bool s = false, t = false;

      for (MaxWeightedMatching<SmartGraph>::BlossomIt n(mwm, i);

           n != INVALID; ++n) {

        if (graph.u(e) == n) s = true;

        if (graph.v(e) == n) t = true;

      }

      if (s == true && t == true) {

        rw += mwm.blossomValue(i);

      }

    }

    rw -= weight[e] * mwm.dualScale;

    check(rw >= 0, "Negative reduced weight");

    check(rw == 0 || !mwm.matching(e),

          "Non-zero reduced weight on matching edge");

  }

  int pv = 0;

  for (SmartGraph::NodeIt n(graph); n != INVALID; ++n) {

    if (mwm.matching(n) != INVALID) {

      check(mwm.nodeValue(n) >= 0, "Invalid node value");

      pv += weight[mwm.matching(n)];

      SmartGraph::Node o = graph.target(mwm.matching(n));

      check(mwm.mate(n) == o, "Invalid matching");

      check(mwm.matching(n) == graph.oppositeArc(mwm.matching(o)),

            "Invalid matching");

    } else {

      check(mwm.mate(n) == INVALID, "Invalid matching");

      check(mwm.nodeValue(n) == 0, "Invalid matching");

    }

  }

  int dv = 0;

  for (SmartGraph::NodeIt n(graph); n != INVALID; ++n) {

    dv += mwm.nodeValue(n);

  }

  for (int i = 0; i < mwm.blossomNum(); ++i) {

    check(mwm.blossomValue(i) >= 0, "Invalid blossom value");

    check(mwm.blossomSize(i) % 2 == 1, "Even blossom size");

    dv += mwm.blossomValue(i) * ((mwm.blossomSize(i) - 1) / 2);

  }

  check(pv * mwm.dualScale == dv * 2, "Wrong duality");

  return;

}

void checkWeightedPerfectMatching(const SmartGraph& graph,

                          const SmartGraph::EdgeMap<int>& weight,

                          const MaxWeightedPerfectMatching<SmartGraph>& mwpm) {

  for (SmartGraph::EdgeIt e(graph); e != INVALID; ++e) {

    if (graph.u(e) == graph.v(e)) continue;

    int rw = mwpm.nodeValue(graph.u(e)) + mwpm.nodeValue(graph.v(e));

    for (int i = 0; i < mwpm.blossomNum(); ++i) {

      bool s = false, t = false;

      for (MaxWeightedPerfectMatching<SmartGraph>::BlossomIt n(mwpm, i);

           n != INVALID; ++n) {

        if (graph.u(e) == n) s = true;

        if (graph.v(e) == n) t = true;

      }

      if (s == true && t == true) {

        rw += mwpm.blossomValue(i);

      }

    }

    rw -= weight[e] * mwpm.dualScale;

    check(rw >= 0, "Negative reduced weight");

    check(rw == 0 || !mwpm.matching(e),

          "Non-zero reduced weight on matching edge");

  }

  int pv = 0;

  for (SmartGraph::NodeIt n(graph); n != INVALID; ++n) {

    check(mwpm.matching(n) != INVALID, "Non perfect");

    pv += weight[mwpm.matching(n)];

    SmartGraph::Node o = graph.target(mwpm.matching(n));

    check(mwpm.mate(n) == o, "Invalid matching");

    check(mwpm.matching(n) == graph.oppositeArc(mwpm.matching(o)),

          "Invalid matching");

  }

  int dv = 0;

  for (SmartGraph::NodeIt n(graph); n != INVALID; ++n) {

    dv += mwpm.nodeValue(n);

  }

  for (int i = 0; i < mwpm.blossomNum(); ++i) {

    check(mwpm.blossomValue(i) >= 0, "Invalid blossom value");

    check(mwpm.blossomSize(i) % 2 == 1, "Even blossom size");

    dv += mwpm.blossomValue(i) * ((mwpm.blossomSize(i) - 1) / 2);

  }

  check(pv * mwpm.dualScale == dv * 2, "Wrong duality");

  return;

}

int main() {

  for (int i = 0; i < lgfn; ++i) {

    SmartGraph graph;

    SmartGraph::EdgeMap<int> weight(graph);

    istringstream lgfs(lgf[i]);

    graphReader(graph, lgfs).

      edgeMap("weight", weight).run();

    MaxMatching<SmartGraph> mm(graph);

    mm.run();

    checkMatching(graph, mm);

    MaxWeightedMatching<SmartGraph> mwm(graph, weight);

    mwm.run();

/* -*- mode: C++; indent-tabs-mode: nil; -*-

 *

 * This file is a part of LEMON, a generic C++ optimization library.

 *

 * Copyright (C) 2003-2009

 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

 * (Egervary Research Group on Combinatorial Optimization, EGRES).

 *

 * Permission to use, modify and distribute this software is granted

 * provided that this copyright notice appears in all copies. For

 * precise terms see the accompanying LICENSE file.

 *

 * This software is provided "AS IS" with no warranty of any kind,

 * express or implied, and with no claim as to its suitability for any

 * purpose.

 *

 */

///\ingroup tools

///\file

///\brief DIMACS problem solver.

///

/// This program solves various problems given in DIMACS format.

///

/// See

/// \code

///   dimacs-solver --help

/// \endcode

/// for more info on usage.

#include <iostream>

#include <fstream>

#include <cstring>

#include <lemon/smart_graph.h>

#include <lemon/dimacs.h>

#include <lemon/lgf_writer.h>

#include <lemon/time_measure.h>

#include <lemon/arg_parser.h>

#include <lemon/error.h>

#include <lemon/dijkstra.h>

#include <lemon/preflow.h>

using namespace lemon;

typedef SmartDigraph Digraph;

DIGRAPH_TYPEDEFS(Digraph);

typedef SmartGraph Graph;

template<class Value>

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

              DimacsDescriptor &desc)

{

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

  Digraph g;

  Node s;

  Digraph::ArcMap<Value> len(g);

  Timer t;

  t.restart();

  readDimacsSp(is, g, len, s, desc);

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

  t.restart();

  Dijkstra<Digraph, Digraph::ArcMap<Value> > dij(g,len);

  if(report) std::cerr << "Setup Dijkstra class: " << t << '\n';

  t.restart();

  dij.run(s);

  if(report) std::cerr << "Run Dijkstra: " << t << '\n';

}

template<class Value>

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

               Value infty, DimacsDescriptor &desc)

{

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

  Digraph g;

  Node s,t;

  Digraph::ArcMap<Value> cap(g);

  Timer ti;

  ti.restart();

  readDimacsMax(is, g, cap, s, t, infty, desc);

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

  ti.restart();

  Preflow<Digraph, Digraph::ArcMap<Value> > pre(g,cap,s,t);

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

  ti.restart();

  pre.run();

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

  if(report) std::cerr << "\nMax flow value: " << pre.flowValue() << '\n';  

}

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

              DimacsDescriptor &desc)

{

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

  Graph g;

  Timer ti;

  ti.restart();

  readDimacsMat(is, g, desc);

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

  ti.restart();

  MaxMatching<Graph> mat(g);

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

  ti.restart();

  mat.run();

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

  if(report) std::cerr << "\nCardinality of max matching: "

                       << mat.matchingSize() << '\n';  

}

template<class Value>

void solve(ArgParser &ap, std::istream &is, std::ostream &os,

           DimacsDescriptor &desc)

{

  std::stringstream iss(static_cast<std::string>(ap["infcap"]));

  Value infty;

  iss >> infty;

  if(iss.fail())

    {

      std::cerr << "Cannot interpret '"

                << static_cast<std::string>(ap["infcap"]) << "' as infinite"

                << std::endl;

      exit(1);

    }

  switch(desc.type)

    {

    case DimacsDescriptor::MIN:

      std::cerr <<

        "\n\n Sorry, the min. cost flow solver is not yet available.\n";

      break;

    case DimacsDescriptor::MAX:

      solve_max<Value>(ap,is,os,infty,desc);

      break;

    case DimacsDescriptor::SP:

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

      break;

    case DimacsDescriptor::MAT:

      solve_mat(ap,is,os,desc);

      break;

    default:

      break;

    }

}

int main(int argc, const char *argv[]) {

  typedef SmartDigraph Digraph;

  typedef Digraph::Arc Arc;

  std::string inputName;

  std::string outputName;

  ArgParser ap(argc, argv);

  ap.other("[INFILE [OUTFILE]]",

           "If either the INFILE or OUTFILE file is missing the standard\n"

           "     input/output will be used instead.")

    .boolOption("q", "Do not print any report")

    .boolOption("int","Use 'int' for capacities, costs etc. (default)")

    .optionGroup("datatype","int")

#ifdef HAVE_LONG_LONG

    .boolOption("long","Use 'long long' for capacities, costs etc.")

    .optionGroup("datatype","long")

#endif

    .boolOption("double","Use 'double' for capacities, costs etc.")

    .optionGroup("datatype","double")

    .boolOption("ldouble","Use 'long double' for capacities, costs etc.")

    .optionGroup("datatype","ldouble")

    .onlyOneGroup("datatype")

    .stringOption("infcap","Value used for 'very high' capacities","0")

    .run();

  std::ifstream input;

  std::ofstream output;

  switch(ap.files().size())

    {

    case 2:

      output.open(ap.files()[1].c_str());

      if (!output) {

        throw IoError("Cannot open the file for writing", ap.files()[1]);

      }

    case 1:

      input.open(ap.files()[0].c_str());

      if (!input) {

        throw IoError("File cannot be found", ap.files()[0]);

      }

    case 0:

      break;

    default:

      std::cerr << ap.commandName() << ": too many arguments\n";

      return 1;

    }

  std::istream& is = (ap.files().size()<1 ? std::cin : input);

  std::ostream& os = (ap.files().size()<2 ? std::cout : output);

  DimacsDescriptor desc = dimacsType(is);

  if(!ap.given("q"))

    {

      std::cout << "Problem type: ";

      switch(desc.type)

        {

        case DimacsDescriptor::MIN:

          std::cout << "min";

          break;

        case DimacsDescriptor::MAX:

          std::cout << "max";

          break;

        case DimacsDescriptor::SP:

          std::cout << "sp";

        case DimacsDescriptor::MAT:

          std::cout << "mat";

          break;

        default:

          exit(1);

          break;

        }

      std::cout << "\nNum of nodes: " << desc.nodeNum;

      std::cout << "\nNum of arcs:  " << desc.edgeNum;

      std::cout << "\n\n";

    }

  if(ap.given("double"))

    solve<double>(ap,is,os,desc);

  else if(ap.given("ldouble"))

    solve<long double>(ap,is,os,desc);

#ifdef HAVE_LONG_LONG

  else if(ap.given("long"))

    solve<long long>(ap,is,os,desc);

#endif

  else solve<int>(ap,is,os,desc);

  return 0;

}