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
|
/* ==========================================
* 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.
*/
/* ------------------------------
* TransitiveClosureTest.java
* ------------------------------
* (C) Copyright 2007, by Vinayak R. Borkar.
*
* Original Author: Vinayak R. Borkar
* Contributor(s):
*
* Changes
* -------
* 5-May-2007: Initial revision (VRB);
*
*/
package org.jgrapht.alg;
import junit.framework.*;
import org.jgrapht.*;
import org.jgrapht.generate.*;
import org.jgrapht.graph.*;
/**
*/
public class TransitiveClosureTest
extends TestCase
{
//~ Methods ----------------------------------------------------------------
public void testLinearGraph()
{
SimpleDirectedGraph<Integer, DefaultEdge> graph =
new SimpleDirectedGraph<Integer, DefaultEdge>(DefaultEdge.class);
int N = 10;
LinearGraphGenerator<Integer, DefaultEdge> gen =
new LinearGraphGenerator<Integer, DefaultEdge>(N);
VertexFactory<Integer> vf =
new VertexFactory<Integer>() {
private int m_index = 0;
public Integer createVertex()
{
return Integer.valueOf(m_index++);
}
};
gen.generateGraph(graph, vf, null);
TransitiveClosure.INSTANCE.closeSimpleDirectedGraph(graph);
assertEquals(true, graph.edgeSet().size() == ((N * (N - 1)) / 2));
for (int i = 0; i < N; ++i) {
for (int j = i + 1; j < N; ++j) {
assertEquals(
true,
graph.getEdge(Integer.valueOf(i), Integer.valueOf(j))
!= null);
}
}
}
public void testRingGraph()
{
SimpleDirectedGraph<Integer, DefaultEdge> graph =
new SimpleDirectedGraph<Integer, DefaultEdge>(DefaultEdge.class);
int N = 10;
RingGraphGenerator<Integer, DefaultEdge> gen =
new RingGraphGenerator<Integer, DefaultEdge>(N);
VertexFactory<Integer> vf =
new VertexFactory<Integer>() {
private int m_index = 0;
public Integer createVertex()
{
return Integer.valueOf(m_index++);
}
};
gen.generateGraph(graph, vf, null);
TransitiveClosure.INSTANCE.closeSimpleDirectedGraph(graph);
assertEquals(true, graph.edgeSet().size() == (N * (N - 1)));
for (int i = 0; i < N; ++i) {
for (int j = 0; j < N; ++j) {
assertEquals(
true,
(i == j)
|| (graph.getEdge(Integer.valueOf(i), Integer.valueOf(j))
!= null));
}
}
}
}
// End TransitiveClosureTest.java
|
