tools/dimacs-solver.cc
author Peter Kovacs <kpeter@inf.elte.hu>
Mon, 23 Feb 2009 14:51:10 +0100
changeset 579 997a75bac45a
parent 573 28b154307c0d
child 608 6e0525ec5355
child 649 a79ef774fae1
permissions -rw-r--r--
Small improvements in DIMACS solver (#226)
alpar@400
     1
/* -*- mode: C++; indent-tabs-mode: nil; -*-
alpar@400
     2
 *
alpar@400
     3
 * This file is a part of LEMON, a generic C++ optimization library.
alpar@400
     4
 *
alpar@463
     5
 * Copyright (C) 2003-2009
alpar@400
     6
 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
alpar@400
     7
 * (Egervary Research Group on Combinatorial Optimization, EGRES).
alpar@400
     8
 *
alpar@400
     9
 * Permission to use, modify and distribute this software is granted
alpar@400
    10
 * provided that this copyright notice appears in all copies. For
alpar@400
    11
 * precise terms see the accompanying LICENSE file.
alpar@400
    12
 *
alpar@400
    13
 * This software is provided "AS IS" with no warranty of any kind,
alpar@400
    14
 * express or implied, and with no claim as to its suitability for any
alpar@400
    15
 * purpose.
alpar@400
    16
 *
alpar@400
    17
 */
alpar@400
    18
alpar@400
    19
///\ingroup tools
alpar@400
    20
///\file
kpeter@579
    21
///\brief DIMACS problem solver.
alpar@400
    22
///
kpeter@579
    23
/// This program solves various problems given in DIMACS format.
alpar@400
    24
///
alpar@400
    25
/// See
alpar@400
    26
/// \verbatim
alpar@573
    27
///  dimacs-solver --help
alpar@400
    28
/// \endverbatim
alpar@400
    29
/// for more info on usage.
alpar@400
    30
///
alpar@400
    31
alpar@400
    32
#include <iostream>
alpar@400
    33
#include <fstream>
alpar@400
    34
#include <cstring>
alpar@400
    35
alpar@400
    36
#include <lemon/smart_graph.h>
alpar@400
    37
#include <lemon/dimacs.h>
alpar@400
    38
#include <lemon/lgf_writer.h>
alpar@573
    39
#include <lemon/time_measure.h>
alpar@400
    40
alpar@400
    41
#include <lemon/arg_parser.h>
alpar@402
    42
#include <lemon/error.h>
alpar@400
    43
alpar@573
    44
#include <lemon/dijkstra.h>
alpar@573
    45
#include <lemon/preflow.h>
alpar@573
    46
#include <lemon/max_matching.h>
alpar@573
    47
alpar@400
    48
using namespace lemon;
alpar@573
    49
typedef SmartDigraph Digraph;
alpar@573
    50
DIGRAPH_TYPEDEFS(Digraph);
alpar@573
    51
typedef SmartGraph Graph;
alpar@400
    52
alpar@573
    53
template<class Value>
alpar@573
    54
void solve_sp(ArgParser &ap, std::istream &is, std::ostream &,
alpar@573
    55
              DimacsDescriptor &desc)
alpar@573
    56
{
alpar@573
    57
  bool report = !ap.given("q");
alpar@573
    58
  Digraph g;
alpar@573
    59
  Node s;
alpar@573
    60
  Digraph::ArcMap<Value> len(g);
alpar@573
    61
  Timer t;
alpar@573
    62
  t.restart();
alpar@573
    63
  readDimacsSp(is, g, len, s, desc);
alpar@573
    64
  if(report) std::cerr << "Read the file: " << t << '\n';
alpar@573
    65
  t.restart();
alpar@573
    66
  Dijkstra<Digraph, Digraph::ArcMap<Value> > dij(g,len);
alpar@573
    67
  if(report) std::cerr << "Setup Dijkstra class: " << t << '\n';
alpar@573
    68
  t.restart();
alpar@573
    69
  dij.run(s);
alpar@573
    70
  if(report) std::cerr << "Run Dijkstra: " << t << '\n';
alpar@573
    71
}
alpar@573
    72
alpar@573
    73
template<class Value>
alpar@573
    74
void solve_max(ArgParser &ap, std::istream &is, std::ostream &,
alpar@573
    75
              DimacsDescriptor &desc)
alpar@573
    76
{
alpar@573
    77
  bool report = !ap.given("q");
alpar@573
    78
  Digraph g;
alpar@573
    79
  Node s,t;
alpar@573
    80
  Digraph::ArcMap<Value> cap(g);
alpar@573
    81
  Timer ti;
alpar@573
    82
  ti.restart();
alpar@573
    83
  readDimacsMax(is, g, cap, s, t, desc);
alpar@573
    84
  if(report) std::cerr << "Read the file: " << ti << '\n';
alpar@573
    85
  ti.restart();
alpar@573
    86
  Preflow<Digraph, Digraph::ArcMap<Value> > pre(g,cap,s,t);
alpar@573
    87
  if(report) std::cerr << "Setup Preflow class: " << ti << '\n';
alpar@573
    88
  ti.restart();
alpar@573
    89
  pre.run();
alpar@573
    90
  if(report) std::cerr << "Run Preflow: " << ti << '\n';
alpar@573
    91
  if(report) std::cerr << "\nMax flow value: " << pre.flowValue() << '\n';  
alpar@573
    92
}
alpar@573
    93
alpar@573
    94
void solve_mat(ArgParser &ap, std::istream &is, std::ostream &,
alpar@573
    95
              DimacsDescriptor &desc)
alpar@573
    96
{
alpar@573
    97
  bool report = !ap.given("q");
alpar@573
    98
  Graph g;
alpar@573
    99
  Timer ti;
alpar@573
   100
  ti.restart();
alpar@573
   101
  readDimacsMat(is, g, desc);
alpar@573
   102
  if(report) std::cerr << "Read the file: " << ti << '\n';
alpar@573
   103
  ti.restart();
alpar@573
   104
  MaxMatching<Graph> mat(g);
alpar@573
   105
  if(report) std::cerr << "Setup MaxMatching class: " << ti << '\n';
alpar@573
   106
  ti.restart();
alpar@573
   107
  mat.run();
alpar@573
   108
  if(report) std::cerr << "Run MaxMatching: " << ti << '\n';
alpar@573
   109
  if(report) std::cerr << "\nCardinality of max matching: "
alpar@573
   110
                       << mat.matchingSize() << '\n';  
alpar@573
   111
}
alpar@573
   112
alpar@573
   113
alpar@573
   114
template<class Value>
alpar@573
   115
void solve(ArgParser &ap, std::istream &is, std::ostream &os,
alpar@573
   116
           DimacsDescriptor &desc)
alpar@573
   117
{
alpar@573
   118
  switch(desc.type)
alpar@573
   119
    {
alpar@573
   120
    case DimacsDescriptor::MIN:
alpar@573
   121
      std::cerr <<
kpeter@579
   122
        "\n\n Sorry, the min. cost flow solver is not yet available.\n";
alpar@573
   123
      break;
alpar@573
   124
    case DimacsDescriptor::MAX:
alpar@573
   125
      solve_max<Value>(ap,is,os,desc);
alpar@573
   126
      break;
alpar@573
   127
    case DimacsDescriptor::SP:
alpar@573
   128
      solve_sp<Value>(ap,is,os,desc);
alpar@573
   129
      break;
alpar@573
   130
    case DimacsDescriptor::MAT:
alpar@573
   131
      solve_mat(ap,is,os,desc);
alpar@573
   132
      break;
alpar@573
   133
    default:
alpar@573
   134
      break;
alpar@573
   135
    }
alpar@573
   136
}
alpar@400
   137
alpar@400
   138
int main(int argc, const char *argv[]) {
alpar@400
   139
  typedef SmartDigraph Digraph;
alpar@400
   140
alpar@400
   141
  typedef Digraph::Arc Arc;
alpar@400
   142
alpar@400
   143
  std::string inputName;
alpar@400
   144
  std::string outputName;
alpar@400
   145
alpar@400
   146
  ArgParser ap(argc, argv);
alpar@402
   147
  ap.other("[INFILE [OUTFILE]]",
alpar@402
   148
           "If either the INFILE or OUTFILE file is missing the standard\n"
alpar@402
   149
           "     input/output will be used instead.")
alpar@573
   150
    .boolOption("q", "Do not print any report")
alpar@573
   151
    .boolOption("int","Use 'int' for capacities, costs etc. (default)")
alpar@573
   152
    .optionGroup("datatype","int")
alpar@573
   153
#ifdef HAVE_LONG_LONG
alpar@573
   154
    .boolOption("long","Use 'long long' for capacities, costs etc.")
alpar@573
   155
    .optionGroup("datatype","long")
alpar@573
   156
#endif
alpar@573
   157
    .boolOption("double","Use 'double' for capacities, costs etc.")
alpar@573
   158
    .optionGroup("datatype","double")
alpar@573
   159
    .boolOption("ldouble","Use 'long double' for capacities, costs etc.")
alpar@573
   160
    .optionGroup("datatype","ldouble")
alpar@573
   161
    .onlyOneGroup("datatype")
alpar@400
   162
    .run();
alpar@400
   163
alpar@573
   164
  std::ifstream input;
alpar@573
   165
  std::ofstream output;
alpar@402
   166
alpar@402
   167
  switch(ap.files().size())
alpar@402
   168
    {
alpar@402
   169
    case 2:
alpar@402
   170
      output.open(ap.files()[1].c_str());
alpar@402
   171
      if (!output) {
alpar@402
   172
        throw IoError("Cannot open the file for writing", ap.files()[1]);
alpar@402
   173
      }
alpar@402
   174
    case 1:
alpar@402
   175
      input.open(ap.files()[0].c_str());
alpar@402
   176
      if (!input) {
alpar@402
   177
        throw IoError("File cannot be found", ap.files()[0]);
alpar@402
   178
      }
alpar@402
   179
    case 0:
alpar@402
   180
      break;
alpar@402
   181
    default:
alpar@573
   182
      std::cerr << ap.commandName() << ": too many arguments\n";
alpar@402
   183
      return 1;
kpeter@579
   184
    }
alpar@573
   185
  std::istream& is = (ap.files().size()<1 ? std::cin : input);
alpar@573
   186
  std::ostream& os = (ap.files().size()<2 ? std::cout : output);
alpar@402
   187
alpar@402
   188
  DimacsDescriptor desc = dimacsType(is);
alpar@573
   189
  
alpar@573
   190
  if(!ap.given("q"))
alpar@402
   191
    {
alpar@573
   192
      std::cout << "Problem type: ";
alpar@573
   193
      switch(desc.type)
alpar@573
   194
        {
alpar@573
   195
        case DimacsDescriptor::MIN:
alpar@573
   196
          std::cout << "min";
alpar@573
   197
          break;
alpar@573
   198
        case DimacsDescriptor::MAX:
alpar@573
   199
          std::cout << "max";
alpar@573
   200
          break;
alpar@573
   201
        case DimacsDescriptor::SP:
alpar@573
   202
          std::cout << "sp";
alpar@573
   203
        case DimacsDescriptor::MAT:
alpar@573
   204
          std::cout << "mat";
alpar@573
   205
          break;
alpar@573
   206
        default:
alpar@573
   207
          exit(1);
alpar@573
   208
          break;
alpar@573
   209
        }
alpar@573
   210
      std::cout << "\nNum of nodes: " << desc.nodeNum;
alpar@573
   211
      std::cout << "\nNum of arcs:  " << desc.edgeNum;
kpeter@579
   212
      std::cout << "\n\n";
alpar@400
   213
    }
alpar@573
   214
    
alpar@573
   215
  if(ap.given("double"))
alpar@573
   216
    solve<double>(ap,is,os,desc);
alpar@573
   217
  else if(ap.given("ldouble"))
alpar@573
   218
    solve<long double>(ap,is,os,desc);
alpar@573
   219
#ifdef HAVE_LONG_LONG
alpar@573
   220
  else if(ap.given("long"))
alpar@573
   221
    solve<long long>(ap,is,os,desc);
alpar@573
   222
#endif
alpar@573
   223
  else solve<int>(ap,is,os,desc);
alpar@573
   224
alpar@400
   225
  return 0;
alpar@400
   226
}