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
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
|
/*
* vim: ts=4 sw=4 et tw=0 wm=0
*
* libcola - A library providing force-directed network layout using the
* stress-majorization method subject to separation constraints.
*
* Copyright (C) 2006-2008 Monash University
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library in the file LICENSE; if not,
* write to the Free Software Foundation, Inc., 59 Temple Place,
* Suite 330, Boston, MA 02111-1307 USA
*
*/
#include <iostream>
#include <vector>
#include <assert.h>
#include <libcola/cola.h>
#include <libcola/max_acyclic_subgraph.h>
#include "graphlayouttest.h"
using namespace std;
using namespace cola;
using vpsc::Rectangle;
int main() {
MaxAcyclicSubgraph *mas;
Edges case_a, case_b, case_c, case_d, case_e, case_f;
Edges *subgraph = nullptr;
vector<Rectangle *> rs;
unsigned V;
// create case A
// case A consists of a basic graph where the start point is a source
cout << endl << "ENTERING CASE A" << endl;
V = 5;
case_a.push_back(Edge(0, 1));
case_a.push_back(Edge(1, 2));
case_a.push_back(Edge(2, 3));
case_a.push_back(Edge(3, 4));
case_a.push_back(Edge(4, 1));
// detect the subgraph
mas = new MaxAcyclicSubgraph(V, &case_a);
subgraph = mas->find_subgraph();
if (subgraph != nullptr) {
cout << "subgraph->size(): " << subgraph->size() << endl;
cout << "Ea: ";
for (unsigned i = 0; i < subgraph->size(); i++) {
// print out the subgraph
cout << "(" << (*subgraph)[i].first << ", " << (*subgraph)[i].second << ") ";
}
cout << endl;
// output a picture
rs.push_back(new Rectangle(10,10+5,10,10+5));
rs.push_back(new Rectangle(30,30+5,30,30+5));
rs.push_back(new Rectangle(30,30+5,60,60+5));
rs.push_back(new Rectangle(65,65+5,60,60+5));
rs.push_back(new Rectangle(65,65+5,30,30+5));
assert(rs.size() == V);
output_svg(rs, case_a, "mas_case_a.svg", false, true, subgraph);
for (unsigned i = 0; i < rs.size(); i++) { delete rs[i]; }
rs.clear();
delete subgraph;
}
else {
cout << "No subgraph found" << endl;
}
// create case B
// case B is the same graph of case A but with more elements
cout << endl << "ENTERING CASE B" << endl;
V = 7;
case_b.push_back(Edge(0, 1));
case_b.push_back(Edge(1, 2));
case_b.push_back(Edge(2, 3));
case_b.push_back(Edge(3, 4));
case_b.push_back(Edge(4, 1));
case_b.push_back(Edge(5, 2));
case_b.push_back(Edge(6, 5));
// detect the subgraph
mas->mod_graph(V, &case_b);
subgraph = mas->find_subgraph();
if (subgraph != nullptr) {
cout << "subgraph->size(): " << subgraph->size() << endl;
cout << "Ea: ";
for (unsigned i = 0; i < subgraph->size(); i++) {
// print out the subgraph
cout << "(" << (*subgraph)[i].first << ", " << (*subgraph)[i].second << ") ";
}
cout << endl;
// output a picture
rs.push_back(new Rectangle(10,10+5,10,10+5));
rs.push_back(new Rectangle(30,30+5,30,30+5));
rs.push_back(new Rectangle(30,30+5,60,60+5));
rs.push_back(new Rectangle(65,65+5,60,60+5));
rs.push_back(new Rectangle(65,65+5,30,30+5));
rs.push_back(new Rectangle(30,30+5,90,90+5));
rs.push_back(new Rectangle(65,65+5,90,90+5));
assert(rs.size() == V);
output_svg(rs, case_b, "mas_case_b.svg", false, true, subgraph);
for (unsigned i = 0; i < rs.size(); i++) { delete rs[i]; }
rs.clear();
delete subgraph;
}
else {
cout << "No subgraph found" << endl;
}
// create case C
// case C is a more complicated graph with nested subgraph
cout << endl << "ENTERING CASE C" << endl;
V = 14;
case_c.push_back(Edge(0, 1));
case_c.push_back(Edge(0, 5));
case_c.push_back(Edge(0, 6));
case_c.push_back(Edge(2, 0));
case_c.push_back(Edge(3, 5));
case_c.push_back(Edge(4, 3));
case_c.push_back(Edge(5, 4));
case_c.push_back(Edge(5, 13));
case_c.push_back(Edge(6, 2));
case_c.push_back(Edge(6, 9));
case_c.push_back(Edge(7, 6));
case_c.push_back(Edge(8, 7));
case_c.push_back(Edge(9, 10));
case_c.push_back(Edge(9, 11));
case_c.push_back(Edge(9, 12));
case_c.push_back(Edge(10, 6));
case_c.push_back(Edge(12, 10));
case_c.push_back(Edge(13, 4));
// detect the subgraph
mas->mod_graph(V, &case_c);
subgraph = mas->find_subgraph();
if (subgraph != nullptr) {
cout << "subgraph->size(): " << subgraph->size() << endl;
cout << "Ea: ";
for (unsigned i = 0; i < subgraph->size(); i++) {
// print out the subgraph
cout << "(" << (*subgraph)[i].first << ", " << (*subgraph)[i].second << ") ";
}
cout << endl;
// output a picture
rs.push_back(new Rectangle(10,10+5,10,10+5)); // node 0
rs.push_back(new Rectangle(20,20+5,40,40+5)); // node 1
rs.push_back(new Rectangle(40,40+5,30,30+5)); // node 2
rs.push_back(new Rectangle(30,30+5,60,60+5)); // node 3
rs.push_back(new Rectangle(60,60+5,60,60+5)); // node 4
rs.push_back(new Rectangle(10,10+5,90,90+5)); // node 5
rs.push_back(new Rectangle(80,80+5,15,15+5)); // node 6
rs.push_back(new Rectangle(110,110+5,15,15+5)); // node 7
rs.push_back(new Rectangle(140,140+5,15,15+5)); // node 8
rs.push_back(new Rectangle(110,110+5,60,60+5)); // node 9
rs.push_back(new Rectangle(100,100+5,85,85+5)); // node 10
rs.push_back(new Rectangle(140,140+5,50,50+5)); // node 11
rs.push_back(new Rectangle(140,140+5,70,70+5)); // node 12
rs.push_back(new Rectangle(45,45+5,90,90+5)); // node 13
assert(rs.size() == V);
output_svg(rs, case_c, "mas_case_c.svg", false, true, subgraph);
for(int i = 0; i < V; i++) { delete rs[i]; }
rs.clear();
delete subgraph;
}
else {
cout << "No subgraph found" << endl;
}
// create case D
// case D consists of the same graph as case A but with a different starting location
cout << endl << "ENTERING CASE D" << endl;
V = 5;
case_d.push_back(Edge(0, 1));
case_d.push_back(Edge(1, 2));
case_d.push_back(Edge(2, 3));
case_d.push_back(Edge(3, 0));
case_d.push_back(Edge(4, 1));
// detect the subgraph
mas->mod_graph(V, &case_d);
subgraph = mas->find_subgraph();
if (subgraph != nullptr) {
cout << "subgraph->size(): " << subgraph->size() << endl;
cout << "Ea: ";
for (unsigned i = 0; i < subgraph->size(); i++) {
// print out the subgraph
cout << "(" << (*subgraph)[i].first << ", " << (*subgraph)[i].second << ") ";
}
cout << endl;
// output a picture
rs.push_back(new Rectangle(65,65+5,60,60+5));
rs.push_back(new Rectangle(65,65+5,30,30+5));
rs.push_back(new Rectangle(30,30+5,30,30+5));
rs.push_back(new Rectangle(30,30+5,60,60+5));
rs.push_back(new Rectangle(10,10+5,10,10+5));
assert(rs.size() == V);
output_svg(rs, case_d, "mas_case_d.svg", false, true, subgraph);
for (unsigned i = 0; i < rs.size(); i++) { delete rs[i]; }
rs.clear();
delete subgraph;
}
else {
cout << "No subgraph found" << endl;
}
// create case E
// case E is a reordering of case C
cout << endl << "ENTERING CASE E" << endl;
V = 14;
case_e.push_back(Edge(0, 6));
case_e.push_back(Edge(0, 9));
case_e.push_back(Edge(1, 4));
case_e.push_back(Edge(3, 10));
case_e.push_back(Edge(4, 3));
case_e.push_back(Edge(5, 0));
case_e.push_back(Edge(6, 7));
case_e.push_back(Edge(7, 0));
case_e.push_back(Edge(7, 2));
case_e.push_back(Edge(7, 10));
case_e.push_back(Edge(8, 5));
case_e.push_back(Edge(9, 12));
case_e.push_back(Edge(9, 11));
case_e.push_back(Edge(9, 13));
case_e.push_back(Edge(10, 1));
case_e.push_back(Edge(10, 4));
case_e.push_back(Edge(12, 0));
case_e.push_back(Edge(11, 12));
// detect the subgraph
mas->mod_graph(V, &case_e);
subgraph = mas->find_subgraph();
if (subgraph != nullptr) {
cout << "subgraph->size(): " << subgraph->size() << endl;
cout << "Ea: ";
for (unsigned i = 0; i < subgraph->size(); i++) {
// print out the subgraph
cout << "(" << (*subgraph)[i].first << ", " << (*subgraph)[i].second << ") ";
}
cout << endl;
// output a picture
rs.push_back(new Rectangle(80,80+5,15,15+5)); // node 6
rs.push_back(new Rectangle(45,45+5,90,90+5)); // node 13
rs.push_back(new Rectangle(20,20+5,40,40+5)); // node 1
rs.push_back(new Rectangle(30,30+5,60,60+5)); // node 3
rs.push_back(new Rectangle(60,60+5,60,60+5)); // node 4
rs.push_back(new Rectangle(110,110+5,15,15+5)); // node 7
rs.push_back(new Rectangle(40,40+5,30,30+5)); // node 2
rs.push_back(new Rectangle(10,10+5,10,10+5)); // node 0
rs.push_back(new Rectangle(140,140+5,15,15+5)); // node 8
rs.push_back(new Rectangle(110,110+5,60,60+5)); // node 9
rs.push_back(new Rectangle(10,10+5,90,90+5)); // node 5
rs.push_back(new Rectangle(140,140+5,70,70+5)); // node 12
rs.push_back(new Rectangle(100,100+5,85,85+5)); // node 10
rs.push_back(new Rectangle(140,140+5,50,50+5)); // node 11
assert(rs.size() == V);
output_svg(rs, case_e, "mas_case_e.svg", false, true, subgraph);
for(int i = 0; i < V; i++) { delete rs[i]; }
rs.clear();
delete subgraph;
}
else {
cout << "No subgraph found" << endl;
}
// create case F
// case F consists of the same graph with sinks
cout << endl << "ENTERING CASE F" << endl;
V = 3;
case_f.push_back(Edge(0, 1));
case_f.push_back(Edge(0, 2));
case_f.push_back(Edge(1, 2));
// detect the subgraph
mas->mod_graph(V, &case_f);
subgraph = mas->find_subgraph();
if (subgraph != nullptr) {
cout << "subgraph->size(): " << subgraph->size() << endl;
cout << "Ea: ";
for (unsigned i = 0; i < subgraph->size(); i++) {
// print out the subgraph
cout << "(" << (*subgraph)[i].first << ", " << (*subgraph)[i].second << ") ";
}
cout << endl;
// output a picture
rs.push_back(new Rectangle(10,10+5,10,10+5));
rs.push_back(new Rectangle(40,40+5,30,30+5));
rs.push_back(new Rectangle(15,15+5,60,60+5));
assert(rs.size() == V);
output_svg(rs, case_f, "mas_case_f.svg", false, true, subgraph);
for (unsigned i = 0; i < rs.size(); i++) { delete rs[i]; }
rs.clear();
delete subgraph;
}
else {
cout << "No subgraph found" << endl;
}
// END TEST
delete mas;
return 0;
}
|
