1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
|
/* -*- mode: C++; indent-tabs-mode: nil; -*-
*
* This file is a part of LEMON, a generic C++ optimization library.
*
* Copyright (C) 2003-2013
* 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 <sstream>
#include <lemon/list_graph.h>
#include <lemon/full_graph.h>
#include <lemon/grid_graph.h>
#include <lemon/lgf_reader.h>
#include <lemon/grosso_locatelli_pullan_mc.h>
#include "test_tools.h"
using namespace lemon;
char test_lgf[] =
"@nodes\n"
"label max_clique\n"
"1 0\n"
"2 0\n"
"3 0\n"
"4 1\n"
"5 1\n"
"6 1\n"
"7 1\n"
"@edges\n"
" label\n"
"1 2 1\n"
"1 3 2\n"
"1 4 3\n"
"1 6 4\n"
"2 3 5\n"
"2 5 6\n"
"2 7 7\n"
"3 4 8\n"
"3 5 9\n"
"4 5 10\n"
"4 6 11\n"
"4 7 12\n"
"5 6 13\n"
"5 7 14\n"
"6 7 15\n";
// Check with general graphs
template <typename Param>
void checkMaxCliqueGeneral(Param rule) {
typedef ListGraph GR;
typedef GrossoLocatelliPullanMc<GR> McAlg;
typedef McAlg::CliqueNodeIt CliqueIt;
// Basic tests
{
GR g;
GR::NodeMap<bool> map(g);
McAlg mc(g);
mc.iterationLimit(50);
check(mc.run(rule) == McAlg::SIZE_LIMIT, "Wrong termination cause");
check(mc.cliqueSize() == 0, "Wrong clique size");
check(CliqueIt(mc) == INVALID, "Wrong CliqueNodeIt");
GR::Node u = g.addNode();
check(mc.run(rule) == McAlg::SIZE_LIMIT, "Wrong termination cause");
check(mc.cliqueSize() == 1, "Wrong clique size");
mc.cliqueMap(map);
check(map[u], "Wrong clique map");
CliqueIt it1(mc);
check(static_cast<GR::Node>(it1) == u && ++it1 == INVALID,
"Wrong CliqueNodeIt");
GR::Node v = g.addNode();
check(mc.run(rule) == McAlg::ITERATION_LIMIT, "Wrong termination cause");
check(mc.cliqueSize() == 1, "Wrong clique size");
mc.cliqueMap(map);
check((map[u] && !map[v]) || (map[v] && !map[u]), "Wrong clique map");
CliqueIt it2(mc);
check(it2 != INVALID && ++it2 == INVALID, "Wrong CliqueNodeIt");
g.addEdge(u, v);
check(mc.run(rule) == McAlg::SIZE_LIMIT, "Wrong termination cause");
check(mc.cliqueSize() == 2, "Wrong clique size");
mc.cliqueMap(map);
check(map[u] && map[v], "Wrong clique map");
CliqueIt it3(mc);
check(it3 != INVALID && ++it3 != INVALID && ++it3 == INVALID,
"Wrong CliqueNodeIt");
}
// Test graph
{
GR g;
GR::NodeMap<bool> max_clique(g);
GR::NodeMap<bool> map(g);
std::istringstream input(test_lgf);
graphReader(g, input)
.nodeMap("max_clique", max_clique)
.run();
McAlg mc(g);
mc.iterationLimit(50);
check(mc.run(rule) == McAlg::ITERATION_LIMIT, "Wrong termination cause");
check(mc.cliqueSize() == 4, "Wrong clique size");
mc.cliqueMap(map);
for (GR::NodeIt n(g); n != INVALID; ++n) {
check(map[n] == max_clique[n], "Wrong clique map");
}
int cnt = 0;
for (CliqueIt n(mc); n != INVALID; ++n) {
cnt++;
check(map[n] && max_clique[n], "Wrong CliqueNodeIt");
}
check(cnt == 4, "Wrong CliqueNodeIt");
}
}
// Check with full graphs
template <typename Param>
void checkMaxCliqueFullGraph(Param rule) {
typedef FullGraph GR;
typedef GrossoLocatelliPullanMc<FullGraph> McAlg;
typedef McAlg::CliqueNodeIt CliqueIt;
for (int size = 0; size <= 40; size = size * 3 + 1) {
GR g(size);
GR::NodeMap<bool> map(g);
McAlg mc(g);
check(mc.run(rule) == McAlg::SIZE_LIMIT, "Wrong termination cause");
check(mc.cliqueSize() == size, "Wrong clique size");
mc.cliqueMap(map);
for (GR::NodeIt n(g); n != INVALID; ++n) {
check(map[n], "Wrong clique map");
}
int cnt = 0;
for (CliqueIt n(mc); n != INVALID; ++n) cnt++;
check(cnt == size, "Wrong CliqueNodeIt");
}
}
// Check with grid graphs
template <typename Param>
void checkMaxCliqueGridGraph(Param rule) {
GridGraph g(5, 7);
GridGraph::NodeMap<char> map(g);
GrossoLocatelliPullanMc<GridGraph> mc(g);
mc.iterationLimit(100);
check(mc.run(rule) == mc.ITERATION_LIMIT, "Wrong termination cause");
check(mc.cliqueSize() == 2, "Wrong clique size");
mc.stepLimit(100);
check(mc.run(rule) == mc.STEP_LIMIT, "Wrong termination cause");
check(mc.cliqueSize() == 2, "Wrong clique size");
mc.sizeLimit(2);
check(mc.run(rule) == mc.SIZE_LIMIT, "Wrong termination cause");
check(mc.cliqueSize() == 2, "Wrong clique size");
}
int main() {
checkMaxCliqueGeneral(GrossoLocatelliPullanMc<ListGraph>::RANDOM);
checkMaxCliqueGeneral(GrossoLocatelliPullanMc<ListGraph>::DEGREE_BASED);
checkMaxCliqueGeneral(GrossoLocatelliPullanMc<ListGraph>::PENALTY_BASED);
checkMaxCliqueFullGraph(GrossoLocatelliPullanMc<FullGraph>::RANDOM);
checkMaxCliqueFullGraph(GrossoLocatelliPullanMc<FullGraph>::DEGREE_BASED);
checkMaxCliqueFullGraph(GrossoLocatelliPullanMc<FullGraph>::PENALTY_BASED);
checkMaxCliqueGridGraph(GrossoLocatelliPullanMc<GridGraph>::RANDOM);
checkMaxCliqueGridGraph(GrossoLocatelliPullanMc<GridGraph>::DEGREE_BASED);
checkMaxCliqueGridGraph(GrossoLocatelliPullanMc<GridGraph>::PENALTY_BASED);
return 0;
}
|
