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
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
|
/* ==========================================
* JGraphT : a free Java graph-theory library
* ==========================================
*
* Project Info: http://jgrapht.sourceforge.net/
* Project Creator: Barak Naveh (http://sourceforge.net/users/barak_naveh)
*
* (C) Copyright 2003-2008, by Barak Naveh and Contributors.
*
* 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; if not, write to the Free Software Foundation,
* Inc.,
* 59 Temple Place, Suite 330, Boston, MA 02111-1307, USA.
*/
/* ------------------------------
* ConnectivityInspectorTest.java
* ------------------------------
* (C) Copyright 2003-2008, by Barak Naveh and Contributors.
*
* Original Author: Barak Naveh
* Contributor(s): John V. Sichi
*
* $Id: ConnectivityInspectorTest.java 645 2008-09-30 19:44:48Z perfecthash $
*
* Changes
* -------
* 07-Aug-2003 : Initial revision (BN);
* 20-Apr-2005 : Added StrongConnectivityInspector test (JVS);
*
*/
package org.jgrapht.alg;
import java.util.*;
import junit.framework.*;
import org.jgrapht.*;
import org.jgrapht.generate.*;
import org.jgrapht.graph.*;
/**
* .
*
* @author Barak Naveh
*/
public class ConnectivityInspectorTest
extends TestCase
{
//~ Static fields/initializers ---------------------------------------------
private static final String V1 = "v1";
private static final String V2 = "v2";
private static final String V3 = "v3";
private static final String V4 = "v4";
//~ Instance fields --------------------------------------------------------
//
DefaultEdge e1;
DefaultEdge e2;
DefaultEdge e3;
DefaultEdge e3_b;
DefaultEdge u;
//~ Methods ----------------------------------------------------------------
/**
* .
*
* @return a graph
*/
public Pseudograph<String, DefaultEdge> create()
{
Pseudograph<String, DefaultEdge> g =
new Pseudograph<String, DefaultEdge>(DefaultEdge.class);
assertEquals(0, g.vertexSet().size());
g.addVertex(V1);
assertEquals(1, g.vertexSet().size());
g.addVertex(V2);
assertEquals(2, g.vertexSet().size());
g.addVertex(V3);
assertEquals(3, g.vertexSet().size());
g.addVertex(V4);
assertEquals(4, g.vertexSet().size());
assertEquals(0, g.edgeSet().size());
e1 = g.addEdge(V1, V2);
assertEquals(1, g.edgeSet().size());
e2 = g.addEdge(V2, V3);
assertEquals(2, g.edgeSet().size());
e3 = g.addEdge(V3, V1);
assertEquals(3, g.edgeSet().size());
e3_b = g.addEdge(V3, V1);
assertEquals(4, g.edgeSet().size());
assertNotNull(e3_b);
u = g.addEdge(V1, V1);
assertEquals(5, g.edgeSet().size());
u = g.addEdge(V1, V1);
assertEquals(6, g.edgeSet().size());
return g;
}
/**
* .
*/
public void testDirectedGraph()
{
ListenableDirectedGraph<String, DefaultEdge> g =
new ListenableDirectedGraph<String, DefaultEdge>(
DefaultEdge.class);
g.addVertex(V1);
g.addVertex(V2);
g.addVertex(V3);
g.addEdge(V1, V2);
ConnectivityInspector<String, DefaultEdge> inspector =
new ConnectivityInspector<String, DefaultEdge>(g);
g.addGraphListener(inspector);
assertEquals(false, inspector.isGraphConnected());
g.addEdge(V1, V3);
assertEquals(true, inspector.isGraphConnected());
}
/**
* .
*/
public void testIsGraphConnected()
{
Pseudograph<String, DefaultEdge> g = create();
ConnectivityInspector<String, DefaultEdge> inspector =
new ConnectivityInspector<String, DefaultEdge>(g);
assertEquals(false, inspector.isGraphConnected());
g.removeVertex(V4);
inspector = new ConnectivityInspector<String, DefaultEdge>(g);
assertEquals(true, inspector.isGraphConnected());
g.removeVertex(V1);
assertEquals(1, g.edgeSet().size());
g.removeEdge(e2);
g.addEdge(V2, V2);
assertEquals(1, g.edgeSet().size());
inspector = new ConnectivityInspector<String, DefaultEdge>(g);
assertEquals(false, inspector.isGraphConnected());
}
/**
* .
*/
public void testStronglyConnected1()
{
DirectedGraph<String, DefaultEdge> g =
new DefaultDirectedGraph<String, DefaultEdge>(
DefaultEdge.class);
g.addVertex(V1);
g.addVertex(V2);
g.addVertex(V3);
g.addVertex(V4);
g.addEdge(V1, V2);
g.addEdge(V2, V1); // strongly connected
g.addEdge(V3, V4); // only weakly connected
StrongConnectivityInspector<String, DefaultEdge> inspector =
new StrongConnectivityInspector<String, DefaultEdge>(g);
// convert from List to Set because we need to ignore order
// during comparison
Set<Set<String>> actualSets =
new HashSet<Set<String>>(inspector.stronglyConnectedSets());
// construct the expected answer
Set<Set<String>> expectedSets = new HashSet<Set<String>>();
Set<String> set = new HashSet<String>();
set.add(V1);
set.add(V2);
expectedSets.add(set);
set = new HashSet<String>();
set.add(V3);
expectedSets.add(set);
set = new HashSet<String>();
set.add(V4);
expectedSets.add(set);
assertEquals(expectedSets, actualSets);
actualSets.clear();
List<DirectedSubgraph<String, DefaultEdge>> subgraphs =
inspector.stronglyConnectedSubgraphs();
for (DirectedSubgraph<String, DefaultEdge> sg : subgraphs) {
actualSets.add(sg.vertexSet());
StrongConnectivityInspector<String, DefaultEdge> ci =
new StrongConnectivityInspector<String, DefaultEdge>(sg);
assertTrue(ci.isStronglyConnected());
}
assertEquals(expectedSets, actualSets);
}
/**
* .
*/
public void testStronglyConnected2()
{
DirectedGraph<String, DefaultEdge> g =
new DefaultDirectedGraph<String, DefaultEdge>(
DefaultEdge.class);
g.addVertex(V1);
g.addVertex(V2);
g.addVertex(V3);
g.addVertex(V4);
g.addEdge(V1, V2);
g.addEdge(V2, V1); // strongly connected
g.addEdge(V4, V3); // only weakly connected
g.addEdge(V3, V2); // only weakly connected
StrongConnectivityInspector<String, DefaultEdge> inspector =
new StrongConnectivityInspector<String, DefaultEdge>(g);
// convert from List to Set because we need to ignore order
// during comparison
Set<Set<String>> actualSets =
new HashSet<Set<String>>(inspector.stronglyConnectedSets());
// construct the expected answer
Set<Set<String>> expectedSets = new HashSet<Set<String>>();
Set<String> set = new HashSet<String>();
set.add(V1);
set.add(V2);
expectedSets.add(set);
set = new HashSet<String>();
set.add(V3);
expectedSets.add(set);
set = new HashSet<String>();
set.add(V4);
expectedSets.add(set);
assertEquals(expectedSets, actualSets);
actualSets.clear();
List<DirectedSubgraph<String, DefaultEdge>> subgraphs =
inspector.stronglyConnectedSubgraphs();
for (DirectedSubgraph<String, DefaultEdge> sg : subgraphs) {
actualSets.add(sg.vertexSet());
StrongConnectivityInspector<String, DefaultEdge> ci =
new StrongConnectivityInspector<String, DefaultEdge>(sg);
assertTrue(ci.isStronglyConnected());
}
assertEquals(expectedSets, actualSets);
}
/**
* .
*/
public void testStronglyConnected3()
{
DirectedGraph<String, DefaultEdge> g =
new DefaultDirectedGraph<String, DefaultEdge>(
DefaultEdge.class);
g.addVertex(V1);
g.addVertex(V2);
g.addVertex(V3);
g.addVertex(V4);
g.addEdge(V1, V2);
g.addEdge(V2, V3);
g.addEdge(V3, V1); // strongly connected
g.addEdge(V1, V4);
g.addEdge(V2, V4);
g.addEdge(V3, V4); // weakly connected
StrongConnectivityInspector<String, DefaultEdge> inspector =
new StrongConnectivityInspector<String, DefaultEdge>(g);
// convert from List to Set because we need to ignore order
// during comparison
Set<Set<String>> actualSets =
new HashSet<Set<String>>(inspector.stronglyConnectedSets());
// construct the expected answer
Set<Set<String>> expectedSets = new HashSet<Set<String>>();
Set<String> set = new HashSet<String>();
set.add(V1);
set.add(V2);
set.add(V3);
expectedSets.add(set);
set = new HashSet<String>();
set.add(V4);
expectedSets.add(set);
assertEquals(expectedSets, actualSets);
actualSets.clear();
List<DirectedSubgraph<String, DefaultEdge>> subgraphs =
inspector.stronglyConnectedSubgraphs();
for (DirectedSubgraph<String, DefaultEdge> sg : subgraphs) {
actualSets.add(sg.vertexSet());
StrongConnectivityInspector<String, DefaultEdge> ci =
new StrongConnectivityInspector<String, DefaultEdge>(sg);
assertTrue(ci.isStronglyConnected());
}
assertEquals(expectedSets, actualSets);
}
public void testStronglyConnected4()
{
DefaultDirectedGraph<Integer, String> graph =
new DefaultDirectedGraph<Integer, String>(
new EdgeFactory<Integer, String>() {
public String createEdge(Integer from, Integer to)
{
return (from + "->" + to).intern();
}
});
new RingGraphGenerator<Integer, String>(3).generateGraph(
graph,
new VertexFactory<Integer>() {
private int i = 0;
public Integer createVertex()
{
return i++;
}
},
null);
StrongConnectivityInspector<Integer, String> sc =
new StrongConnectivityInspector<Integer, String>(
graph);
Set<Set<Integer>> expected = new HashSet<Set<Integer>>();
expected.add(graph.vertexSet());
assertEquals(
expected,
new HashSet<Set<Integer>>(sc.stronglyConnectedSets()));
}
}
// End ConnectivityInspectorTest.java
|
