deba@326
|
1 |
/* -*- mode: C++; indent-tabs-mode: nil; -*-
|
deba@326
|
2 |
*
|
deba@326
|
3 |
* This file is a part of LEMON, a generic C++ optimization library.
|
deba@326
|
4 |
*
|
deba@326
|
5 |
* Copyright (C) 2003-2008
|
deba@326
|
6 |
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
|
deba@326
|
7 |
* (Egervary Research Group on Combinatorial Optimization, EGRES).
|
deba@326
|
8 |
*
|
deba@326
|
9 |
* Permission to use, modify and distribute this software is granted
|
deba@326
|
10 |
* provided that this copyright notice appears in all copies. For
|
deba@326
|
11 |
* precise terms see the accompanying LICENSE file.
|
deba@326
|
12 |
*
|
deba@326
|
13 |
* This software is provided "AS IS" with no warranty of any kind,
|
deba@326
|
14 |
* express or implied, and with no claim as to its suitability for any
|
deba@326
|
15 |
* purpose.
|
deba@326
|
16 |
*
|
deba@326
|
17 |
*/
|
deba@326
|
18 |
|
deba@326
|
19 |
#include <iostream>
|
deba@326
|
20 |
#include <sstream>
|
deba@326
|
21 |
#include <vector>
|
deba@326
|
22 |
#include <queue>
|
deba@326
|
23 |
#include <lemon/math.h>
|
deba@326
|
24 |
#include <cstdlib>
|
deba@326
|
25 |
|
deba@326
|
26 |
#include "test_tools.h"
|
deba@326
|
27 |
#include <lemon/smart_graph.h>
|
deba@326
|
28 |
#include <lemon/max_matching.h>
|
deba@326
|
29 |
#include <lemon/lgf_reader.h>
|
deba@326
|
30 |
|
deba@326
|
31 |
using namespace std;
|
deba@326
|
32 |
using namespace lemon;
|
deba@326
|
33 |
|
deba@326
|
34 |
GRAPH_TYPEDEFS(SmartGraph);
|
deba@326
|
35 |
|
deba@326
|
36 |
const int lgfn = 3;
|
deba@326
|
37 |
const std::string lgf[lgfn] = {
|
deba@326
|
38 |
"@nodes\n"
|
deba@326
|
39 |
"label\n"
|
deba@326
|
40 |
"0\n"
|
deba@326
|
41 |
"1\n"
|
deba@326
|
42 |
"2\n"
|
deba@326
|
43 |
"3\n"
|
deba@326
|
44 |
"4\n"
|
deba@326
|
45 |
"5\n"
|
deba@326
|
46 |
"6\n"
|
deba@326
|
47 |
"7\n"
|
deba@326
|
48 |
"@edges\n"
|
deba@326
|
49 |
"label weight\n"
|
deba@326
|
50 |
"7 4 0 984\n"
|
deba@326
|
51 |
"0 7 1 73\n"
|
deba@326
|
52 |
"7 1 2 204\n"
|
deba@326
|
53 |
"2 3 3 583\n"
|
deba@326
|
54 |
"2 7 4 565\n"
|
deba@326
|
55 |
"2 1 5 582\n"
|
deba@326
|
56 |
"0 4 6 551\n"
|
deba@326
|
57 |
"2 5 7 385\n"
|
deba@326
|
58 |
"1 5 8 561\n"
|
deba@326
|
59 |
"5 3 9 484\n"
|
deba@326
|
60 |
"7 5 10 904\n"
|
deba@326
|
61 |
"3 6 11 47\n"
|
deba@326
|
62 |
"7 6 12 888\n"
|
deba@326
|
63 |
"3 0 13 747\n"
|
deba@326
|
64 |
"6 1 14 310\n",
|
deba@326
|
65 |
|
deba@326
|
66 |
"@nodes\n"
|
deba@326
|
67 |
"label\n"
|
deba@326
|
68 |
"0\n"
|
deba@326
|
69 |
"1\n"
|
deba@326
|
70 |
"2\n"
|
deba@326
|
71 |
"3\n"
|
deba@326
|
72 |
"4\n"
|
deba@326
|
73 |
"5\n"
|
deba@326
|
74 |
"6\n"
|
deba@326
|
75 |
"7\n"
|
deba@326
|
76 |
"@edges\n"
|
deba@326
|
77 |
"label weight\n"
|
deba@326
|
78 |
"2 5 0 710\n"
|
deba@326
|
79 |
"0 5 1 241\n"
|
deba@326
|
80 |
"2 4 2 856\n"
|
deba@326
|
81 |
"2 6 3 762\n"
|
deba@326
|
82 |
"4 1 4 747\n"
|
deba@326
|
83 |
"6 1 5 962\n"
|
deba@326
|
84 |
"4 7 6 723\n"
|
deba@326
|
85 |
"1 7 7 661\n"
|
deba@326
|
86 |
"2 3 8 376\n"
|
deba@326
|
87 |
"1 0 9 416\n"
|
deba@326
|
88 |
"6 7 10 391\n",
|
deba@326
|
89 |
|
deba@326
|
90 |
"@nodes\n"
|
deba@326
|
91 |
"label\n"
|
deba@326
|
92 |
"0\n"
|
deba@326
|
93 |
"1\n"
|
deba@326
|
94 |
"2\n"
|
deba@326
|
95 |
"3\n"
|
deba@326
|
96 |
"4\n"
|
deba@326
|
97 |
"5\n"
|
deba@326
|
98 |
"6\n"
|
deba@326
|
99 |
"7\n"
|
deba@326
|
100 |
"@edges\n"
|
deba@326
|
101 |
"label weight\n"
|
deba@326
|
102 |
"6 2 0 553\n"
|
deba@326
|
103 |
"0 7 1 653\n"
|
deba@326
|
104 |
"6 3 2 22\n"
|
deba@326
|
105 |
"4 7 3 846\n"
|
deba@326
|
106 |
"7 2 4 981\n"
|
deba@326
|
107 |
"7 6 5 250\n"
|
deba@326
|
108 |
"5 2 6 539\n"
|
deba@326
|
109 |
};
|
deba@326
|
110 |
|
deba@326
|
111 |
void checkMatching(const SmartGraph& graph,
|
deba@326
|
112 |
const SmartGraph::EdgeMap<int>& weight,
|
deba@326
|
113 |
const MaxWeightedMatching<SmartGraph>& mwm) {
|
deba@326
|
114 |
for (SmartGraph::EdgeIt e(graph); e != INVALID; ++e) {
|
deba@326
|
115 |
if (graph.u(e) == graph.v(e)) continue;
|
deba@326
|
116 |
int rw =
|
deba@326
|
117 |
mwm.nodeValue(graph.u(e)) + mwm.nodeValue(graph.v(e));
|
deba@326
|
118 |
|
deba@326
|
119 |
for (int i = 0; i < mwm.blossomNum(); ++i) {
|
deba@326
|
120 |
bool s = false, t = false;
|
deba@326
|
121 |
for (MaxWeightedMatching<SmartGraph>::BlossomIt n(mwm, i);
|
deba@326
|
122 |
n != INVALID; ++n) {
|
deba@326
|
123 |
if (graph.u(e) == n) s = true;
|
deba@326
|
124 |
if (graph.v(e) == n) t = true;
|
deba@326
|
125 |
}
|
deba@326
|
126 |
if (s == true && t == true) {
|
deba@326
|
127 |
rw += mwm.blossomValue(i);
|
deba@326
|
128 |
}
|
deba@326
|
129 |
}
|
deba@326
|
130 |
rw -= weight[e] * mwm.dualScale;
|
deba@326
|
131 |
|
deba@326
|
132 |
check(rw >= 0, "Negative reduced weight");
|
deba@326
|
133 |
check(rw == 0 || !mwm.matching(e),
|
deba@326
|
134 |
"Non-zero reduced weight on matching arc");
|
deba@326
|
135 |
}
|
deba@326
|
136 |
|
deba@326
|
137 |
int pv = 0;
|
deba@326
|
138 |
for (SmartGraph::NodeIt n(graph); n != INVALID; ++n) {
|
deba@326
|
139 |
if (mwm.matching(n) != INVALID) {
|
deba@326
|
140 |
check(mwm.nodeValue(n) >= 0, "Invalid node value");
|
deba@326
|
141 |
pv += weight[mwm.matching(n)];
|
deba@326
|
142 |
SmartGraph::Node o = graph.target(mwm.matching(n));
|
deba@326
|
143 |
check(mwm.mate(n) == o, "Invalid matching");
|
deba@326
|
144 |
check(mwm.matching(n) == graph.oppositeArc(mwm.matching(o)),
|
deba@326
|
145 |
"Invalid matching");
|
deba@326
|
146 |
} else {
|
deba@326
|
147 |
check(mwm.mate(n) == INVALID, "Invalid matching");
|
deba@326
|
148 |
check(mwm.nodeValue(n) == 0, "Invalid matching");
|
deba@326
|
149 |
}
|
deba@326
|
150 |
}
|
deba@326
|
151 |
|
deba@326
|
152 |
int dv = 0;
|
deba@326
|
153 |
for (SmartGraph::NodeIt n(graph); n != INVALID; ++n) {
|
deba@326
|
154 |
dv += mwm.nodeValue(n);
|
deba@326
|
155 |
}
|
deba@326
|
156 |
|
deba@326
|
157 |
for (int i = 0; i < mwm.blossomNum(); ++i) {
|
deba@326
|
158 |
check(mwm.blossomValue(i) >= 0, "Invalid blossom value");
|
deba@326
|
159 |
check(mwm.blossomSize(i) % 2 == 1, "Even blossom size");
|
deba@326
|
160 |
dv += mwm.blossomValue(i) * ((mwm.blossomSize(i) - 1) / 2);
|
deba@326
|
161 |
}
|
deba@326
|
162 |
|
deba@326
|
163 |
check(pv * mwm.dualScale == dv * 2, "Wrong duality");
|
deba@326
|
164 |
|
deba@326
|
165 |
return;
|
deba@326
|
166 |
}
|
deba@326
|
167 |
|
deba@326
|
168 |
void checkPerfectMatching(const SmartGraph& graph,
|
deba@326
|
169 |
const SmartGraph::EdgeMap<int>& weight,
|
deba@326
|
170 |
const MaxWeightedPerfectMatching<SmartGraph>& mwpm) {
|
deba@326
|
171 |
for (SmartGraph::EdgeIt e(graph); e != INVALID; ++e) {
|
deba@326
|
172 |
if (graph.u(e) == graph.v(e)) continue;
|
deba@326
|
173 |
int rw =
|
deba@326
|
174 |
mwpm.nodeValue(graph.u(e)) + mwpm.nodeValue(graph.v(e));
|
deba@326
|
175 |
|
deba@326
|
176 |
for (int i = 0; i < mwpm.blossomNum(); ++i) {
|
deba@326
|
177 |
bool s = false, t = false;
|
deba@326
|
178 |
for (MaxWeightedPerfectMatching<SmartGraph>::BlossomIt n(mwpm, i);
|
deba@326
|
179 |
n != INVALID; ++n) {
|
deba@326
|
180 |
if (graph.u(e) == n) s = true;
|
deba@326
|
181 |
if (graph.v(e) == n) t = true;
|
deba@326
|
182 |
}
|
deba@326
|
183 |
if (s == true && t == true) {
|
deba@326
|
184 |
rw += mwpm.blossomValue(i);
|
deba@326
|
185 |
}
|
deba@326
|
186 |
}
|
deba@326
|
187 |
rw -= weight[e] * mwpm.dualScale;
|
deba@326
|
188 |
|
deba@326
|
189 |
check(rw >= 0, "Negative reduced weight");
|
deba@326
|
190 |
check(rw == 0 || !mwpm.matching(e),
|
deba@326
|
191 |
"Non-zero reduced weight on matching arc");
|
deba@326
|
192 |
}
|
deba@326
|
193 |
|
deba@326
|
194 |
int pv = 0;
|
deba@326
|
195 |
for (SmartGraph::NodeIt n(graph); n != INVALID; ++n) {
|
deba@326
|
196 |
check(mwpm.matching(n) != INVALID, "Non perfect");
|
deba@326
|
197 |
pv += weight[mwpm.matching(n)];
|
deba@326
|
198 |
SmartGraph::Node o = graph.target(mwpm.matching(n));
|
deba@326
|
199 |
check(mwpm.mate(n) == o, "Invalid matching");
|
deba@326
|
200 |
check(mwpm.matching(n) == graph.oppositeArc(mwpm.matching(o)),
|
deba@326
|
201 |
"Invalid matching");
|
deba@326
|
202 |
}
|
deba@326
|
203 |
|
deba@326
|
204 |
int dv = 0;
|
deba@326
|
205 |
for (SmartGraph::NodeIt n(graph); n != INVALID; ++n) {
|
deba@326
|
206 |
dv += mwpm.nodeValue(n);
|
deba@326
|
207 |
}
|
deba@326
|
208 |
|
deba@326
|
209 |
for (int i = 0; i < mwpm.blossomNum(); ++i) {
|
deba@326
|
210 |
check(mwpm.blossomValue(i) >= 0, "Invalid blossom value");
|
deba@326
|
211 |
check(mwpm.blossomSize(i) % 2 == 1, "Even blossom size");
|
deba@326
|
212 |
dv += mwpm.blossomValue(i) * ((mwpm.blossomSize(i) - 1) / 2);
|
deba@326
|
213 |
}
|
deba@326
|
214 |
|
deba@326
|
215 |
check(pv * mwpm.dualScale == dv * 2, "Wrong duality");
|
deba@326
|
216 |
|
deba@326
|
217 |
return;
|
deba@326
|
218 |
}
|
deba@326
|
219 |
|
deba@326
|
220 |
|
deba@326
|
221 |
int main() {
|
deba@326
|
222 |
|
deba@326
|
223 |
for (int i = 0; i < lgfn; ++i) {
|
deba@326
|
224 |
SmartGraph graph;
|
deba@326
|
225 |
SmartGraph::EdgeMap<int> weight(graph);
|
deba@326
|
226 |
|
deba@326
|
227 |
istringstream lgfs(lgf[i]);
|
deba@326
|
228 |
graphReader(graph, lgfs).
|
deba@326
|
229 |
edgeMap("weight", weight).run();
|
deba@326
|
230 |
|
deba@326
|
231 |
MaxWeightedMatching<SmartGraph> mwm(graph, weight);
|
deba@326
|
232 |
mwm.run();
|
deba@326
|
233 |
checkMatching(graph, weight, mwm);
|
deba@326
|
234 |
|
deba@326
|
235 |
MaxMatching<SmartGraph> mm(graph);
|
deba@326
|
236 |
mm.run();
|
deba@326
|
237 |
|
deba@326
|
238 |
MaxWeightedPerfectMatching<SmartGraph> mwpm(graph, weight);
|
deba@326
|
239 |
bool perfect = mwpm.run();
|
deba@326
|
240 |
|
deba@326
|
241 |
check(perfect == (mm.size() * 2 == countNodes(graph)),
|
deba@326
|
242 |
"Perfect matching found");
|
deba@326
|
243 |
|
deba@326
|
244 |
if (perfect) {
|
deba@326
|
245 |
checkPerfectMatching(graph, weight, mwpm);
|
deba@326
|
246 |
}
|
deba@326
|
247 |
}
|
deba@326
|
248 |
|
deba@326
|
249 |
return 0;
|
deba@326
|
250 |
}
|