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
|
kpeter@631
|
26 |
/// \code
|
kpeter@631
|
27 |
/// dimacs-solver --help
|
kpeter@631
|
28 |
/// \endcode
|
alpar@400
|
29 |
/// for more info on usage.
|
alpar@400
|
30 |
|
alpar@400
|
31 |
#include <iostream>
|
alpar@400
|
32 |
#include <fstream>
|
alpar@400
|
33 |
#include <cstring>
|
alpar@400
|
34 |
|
alpar@400
|
35 |
#include <lemon/smart_graph.h>
|
alpar@400
|
36 |
#include <lemon/dimacs.h>
|
alpar@400
|
37 |
#include <lemon/lgf_writer.h>
|
alpar@573
|
38 |
#include <lemon/time_measure.h>
|
alpar@400
|
39 |
|
alpar@400
|
40 |
#include <lemon/arg_parser.h>
|
alpar@402
|
41 |
#include <lemon/error.h>
|
alpar@400
|
42 |
|
alpar@573
|
43 |
#include <lemon/dijkstra.h>
|
alpar@573
|
44 |
#include <lemon/preflow.h>
|
alpar@573
|
45 |
#include <lemon/max_matching.h>
|
alpar@573
|
46 |
|
alpar@400
|
47 |
using namespace lemon;
|
alpar@573
|
48 |
typedef SmartDigraph Digraph;
|
alpar@573
|
49 |
DIGRAPH_TYPEDEFS(Digraph);
|
alpar@573
|
50 |
typedef SmartGraph Graph;
|
alpar@400
|
51 |
|
alpar@573
|
52 |
template<class Value>
|
alpar@573
|
53 |
void solve_sp(ArgParser &ap, std::istream &is, std::ostream &,
|
alpar@573
|
54 |
DimacsDescriptor &desc)
|
alpar@573
|
55 |
{
|
alpar@573
|
56 |
bool report = !ap.given("q");
|
alpar@573
|
57 |
Digraph g;
|
alpar@573
|
58 |
Node s;
|
alpar@573
|
59 |
Digraph::ArcMap<Value> len(g);
|
alpar@573
|
60 |
Timer t;
|
alpar@573
|
61 |
t.restart();
|
alpar@573
|
62 |
readDimacsSp(is, g, len, s, desc);
|
alpar@573
|
63 |
if(report) std::cerr << "Read the file: " << t << '\n';
|
alpar@573
|
64 |
t.restart();
|
alpar@573
|
65 |
Dijkstra<Digraph, Digraph::ArcMap<Value> > dij(g,len);
|
alpar@573
|
66 |
if(report) std::cerr << "Setup Dijkstra class: " << t << '\n';
|
alpar@573
|
67 |
t.restart();
|
alpar@573
|
68 |
dij.run(s);
|
alpar@573
|
69 |
if(report) std::cerr << "Run Dijkstra: " << t << '\n';
|
alpar@573
|
70 |
}
|
alpar@573
|
71 |
|
alpar@573
|
72 |
template<class Value>
|
alpar@573
|
73 |
void solve_max(ArgParser &ap, std::istream &is, std::ostream &,
|
alpar@608
|
74 |
Value infty, DimacsDescriptor &desc)
|
alpar@573
|
75 |
{
|
alpar@573
|
76 |
bool report = !ap.given("q");
|
alpar@573
|
77 |
Digraph g;
|
alpar@573
|
78 |
Node s,t;
|
alpar@573
|
79 |
Digraph::ArcMap<Value> cap(g);
|
alpar@573
|
80 |
Timer ti;
|
alpar@573
|
81 |
ti.restart();
|
alpar@608
|
82 |
readDimacsMax(is, g, cap, s, t, infty, desc);
|
alpar@573
|
83 |
if(report) std::cerr << "Read the file: " << ti << '\n';
|
alpar@573
|
84 |
ti.restart();
|
alpar@573
|
85 |
Preflow<Digraph, Digraph::ArcMap<Value> > pre(g,cap,s,t);
|
alpar@573
|
86 |
if(report) std::cerr << "Setup Preflow class: " << ti << '\n';
|
alpar@573
|
87 |
ti.restart();
|
alpar@573
|
88 |
pre.run();
|
alpar@573
|
89 |
if(report) std::cerr << "Run Preflow: " << ti << '\n';
|
alpar@573
|
90 |
if(report) std::cerr << "\nMax flow value: " << pre.flowValue() << '\n';
|
alpar@573
|
91 |
}
|
alpar@573
|
92 |
|
alpar@573
|
93 |
void solve_mat(ArgParser &ap, std::istream &is, std::ostream &,
|
alpar@573
|
94 |
DimacsDescriptor &desc)
|
alpar@573
|
95 |
{
|
alpar@573
|
96 |
bool report = !ap.given("q");
|
alpar@573
|
97 |
Graph g;
|
alpar@573
|
98 |
Timer ti;
|
alpar@573
|
99 |
ti.restart();
|
alpar@573
|
100 |
readDimacsMat(is, g, desc);
|
alpar@573
|
101 |
if(report) std::cerr << "Read the file: " << ti << '\n';
|
alpar@573
|
102 |
ti.restart();
|
alpar@573
|
103 |
MaxMatching<Graph> mat(g);
|
alpar@573
|
104 |
if(report) std::cerr << "Setup MaxMatching class: " << ti << '\n';
|
alpar@573
|
105 |
ti.restart();
|
alpar@573
|
106 |
mat.run();
|
alpar@573
|
107 |
if(report) std::cerr << "Run MaxMatching: " << ti << '\n';
|
alpar@573
|
108 |
if(report) std::cerr << "\nCardinality of max matching: "
|
alpar@573
|
109 |
<< mat.matchingSize() << '\n';
|
alpar@573
|
110 |
}
|
alpar@573
|
111 |
|
alpar@573
|
112 |
|
alpar@573
|
113 |
template<class Value>
|
alpar@573
|
114 |
void solve(ArgParser &ap, std::istream &is, std::ostream &os,
|
alpar@573
|
115 |
DimacsDescriptor &desc)
|
alpar@573
|
116 |
{
|
ladanyi@616
|
117 |
std::stringstream iss(static_cast<std::string>(ap["infcap"]));
|
alpar@608
|
118 |
Value infty;
|
alpar@608
|
119 |
iss >> infty;
|
alpar@608
|
120 |
if(iss.fail())
|
alpar@608
|
121 |
{
|
alpar@608
|
122 |
std::cerr << "Cannot interpret '"
|
alpar@608
|
123 |
<< static_cast<std::string>(ap["infcap"]) << "' as infinite"
|
alpar@608
|
124 |
<< std::endl;
|
alpar@608
|
125 |
exit(1);
|
alpar@608
|
126 |
}
|
alpar@608
|
127 |
|
alpar@573
|
128 |
switch(desc.type)
|
alpar@573
|
129 |
{
|
alpar@573
|
130 |
case DimacsDescriptor::MIN:
|
alpar@573
|
131 |
std::cerr <<
|
kpeter@579
|
132 |
"\n\n Sorry, the min. cost flow solver is not yet available.\n";
|
alpar@573
|
133 |
break;
|
alpar@573
|
134 |
case DimacsDescriptor::MAX:
|
alpar@608
|
135 |
solve_max<Value>(ap,is,os,infty,desc);
|
alpar@573
|
136 |
break;
|
alpar@573
|
137 |
case DimacsDescriptor::SP:
|
alpar@573
|
138 |
solve_sp<Value>(ap,is,os,desc);
|
alpar@573
|
139 |
break;
|
alpar@573
|
140 |
case DimacsDescriptor::MAT:
|
alpar@573
|
141 |
solve_mat(ap,is,os,desc);
|
alpar@573
|
142 |
break;
|
alpar@573
|
143 |
default:
|
alpar@573
|
144 |
break;
|
alpar@573
|
145 |
}
|
alpar@573
|
146 |
}
|
alpar@400
|
147 |
|
alpar@400
|
148 |
int main(int argc, const char *argv[]) {
|
alpar@400
|
149 |
typedef SmartDigraph Digraph;
|
alpar@400
|
150 |
|
alpar@400
|
151 |
typedef Digraph::Arc Arc;
|
alpar@400
|
152 |
|
alpar@400
|
153 |
std::string inputName;
|
alpar@400
|
154 |
std::string outputName;
|
alpar@400
|
155 |
|
alpar@400
|
156 |
ArgParser ap(argc, argv);
|
alpar@402
|
157 |
ap.other("[INFILE [OUTFILE]]",
|
alpar@402
|
158 |
"If either the INFILE or OUTFILE file is missing the standard\n"
|
alpar@402
|
159 |
" input/output will be used instead.")
|
alpar@573
|
160 |
.boolOption("q", "Do not print any report")
|
alpar@573
|
161 |
.boolOption("int","Use 'int' for capacities, costs etc. (default)")
|
alpar@573
|
162 |
.optionGroup("datatype","int")
|
alpar@573
|
163 |
#ifdef HAVE_LONG_LONG
|
alpar@573
|
164 |
.boolOption("long","Use 'long long' for capacities, costs etc.")
|
alpar@573
|
165 |
.optionGroup("datatype","long")
|
alpar@573
|
166 |
#endif
|
alpar@573
|
167 |
.boolOption("double","Use 'double' for capacities, costs etc.")
|
alpar@573
|
168 |
.optionGroup("datatype","double")
|
alpar@573
|
169 |
.boolOption("ldouble","Use 'long double' for capacities, costs etc.")
|
alpar@573
|
170 |
.optionGroup("datatype","ldouble")
|
alpar@573
|
171 |
.onlyOneGroup("datatype")
|
alpar@608
|
172 |
.stringOption("infcap","Value used for 'very high' capacities","0")
|
alpar@400
|
173 |
.run();
|
alpar@400
|
174 |
|
alpar@573
|
175 |
std::ifstream input;
|
alpar@573
|
176 |
std::ofstream output;
|
alpar@402
|
177 |
|
alpar@402
|
178 |
switch(ap.files().size())
|
alpar@402
|
179 |
{
|
alpar@402
|
180 |
case 2:
|
alpar@402
|
181 |
output.open(ap.files()[1].c_str());
|
alpar@402
|
182 |
if (!output) {
|
alpar@402
|
183 |
throw IoError("Cannot open the file for writing", ap.files()[1]);
|
alpar@402
|
184 |
}
|
alpar@402
|
185 |
case 1:
|
alpar@402
|
186 |
input.open(ap.files()[0].c_str());
|
alpar@402
|
187 |
if (!input) {
|
alpar@402
|
188 |
throw IoError("File cannot be found", ap.files()[0]);
|
alpar@402
|
189 |
}
|
alpar@402
|
190 |
case 0:
|
alpar@402
|
191 |
break;
|
alpar@402
|
192 |
default:
|
alpar@573
|
193 |
std::cerr << ap.commandName() << ": too many arguments\n";
|
alpar@402
|
194 |
return 1;
|
kpeter@579
|
195 |
}
|
alpar@573
|
196 |
std::istream& is = (ap.files().size()<1 ? std::cin : input);
|
alpar@573
|
197 |
std::ostream& os = (ap.files().size()<2 ? std::cout : output);
|
alpar@402
|
198 |
|
alpar@402
|
199 |
DimacsDescriptor desc = dimacsType(is);
|
alpar@573
|
200 |
|
alpar@573
|
201 |
if(!ap.given("q"))
|
alpar@402
|
202 |
{
|
alpar@573
|
203 |
std::cout << "Problem type: ";
|
alpar@573
|
204 |
switch(desc.type)
|
alpar@573
|
205 |
{
|
alpar@573
|
206 |
case DimacsDescriptor::MIN:
|
alpar@573
|
207 |
std::cout << "min";
|
alpar@573
|
208 |
break;
|
alpar@573
|
209 |
case DimacsDescriptor::MAX:
|
alpar@573
|
210 |
std::cout << "max";
|
alpar@573
|
211 |
break;
|
alpar@573
|
212 |
case DimacsDescriptor::SP:
|
alpar@573
|
213 |
std::cout << "sp";
|
alpar@573
|
214 |
case DimacsDescriptor::MAT:
|
alpar@573
|
215 |
std::cout << "mat";
|
alpar@573
|
216 |
break;
|
alpar@573
|
217 |
default:
|
alpar@573
|
218 |
exit(1);
|
alpar@573
|
219 |
break;
|
alpar@573
|
220 |
}
|
alpar@573
|
221 |
std::cout << "\nNum of nodes: " << desc.nodeNum;
|
alpar@573
|
222 |
std::cout << "\nNum of arcs: " << desc.edgeNum;
|
kpeter@579
|
223 |
std::cout << "\n\n";
|
alpar@400
|
224 |
}
|
alpar@573
|
225 |
|
alpar@573
|
226 |
if(ap.given("double"))
|
alpar@573
|
227 |
solve<double>(ap,is,os,desc);
|
alpar@573
|
228 |
else if(ap.given("ldouble"))
|
alpar@573
|
229 |
solve<long double>(ap,is,os,desc);
|
alpar@573
|
230 |
#ifdef HAVE_LONG_LONG
|
alpar@573
|
231 |
else if(ap.given("long"))
|
alpar@573
|
232 |
solve<long long>(ap,is,os,desc);
|
alpar@573
|
233 |
#endif
|
alpar@573
|
234 |
else solve<int>(ap,is,os,desc);
|
alpar@573
|
235 |
|
alpar@400
|
236 |
return 0;
|
alpar@400
|
237 |
}
|