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
|
/* ==========================================
* 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.
*/
/* -----------------------------
* DefaultDirectedGraphTest.java
* -----------------------------
* (C) Copyright 2003-2008, by Barak Naveh and Contributors.
*
* Original Author: Barak Naveh
* Contributor(s): -
*
* $Id: DefaultDirectedGraphTest.java 645 2008-09-30 19:44:48Z perfecthash $
*
* Changes
* -------
* 09-Aug-2003 : Initial revision (BN);
*
*/
package org.jgrapht.graph;
import java.util.*;
import org.jgrapht.*;
/**
* A unit test for directed multigraph.
*
* @author Barak Naveh
* @since Aug 9, 2003
*/
public class DefaultDirectedGraphTest
extends EnhancedTestCase
{
//~ Instance fields --------------------------------------------------------
private String v1 = "v1";
private String v2 = "v2";
private String v3 = "v3";
//~ Methods ----------------------------------------------------------------
/**
* .
*/
public void testEdgeSetFactory()
{
DirectedMultigraph<String, DefaultEdge> g =
new DirectedMultigraph<String, DefaultEdge>(
DefaultEdge.class);
g.setEdgeSetFactory(new LinkedHashSetFactory<String, DefaultEdge>());
initMultiTriangleWithMultiLoop(g);
}
/**
* .
*/
public void testEdgeOrderDeterminism()
{
DirectedGraph<String, DefaultEdge> g =
new DirectedMultigraph<String, DefaultEdge>(
DefaultEdge.class);
g.addVertex(v1);
g.addVertex(v2);
g.addVertex(v3);
DefaultEdge e1 = g.addEdge(v1, v2);
DefaultEdge e2 = g.addEdge(v2, v3);
DefaultEdge e3 = g.addEdge(v3, v1);
Iterator<DefaultEdge> iter = g.edgeSet().iterator();
assertEquals(e1, iter.next());
assertEquals(e2, iter.next());
assertEquals(e3, iter.next());
// some bonus tests
assertTrue(Graphs.testIncidence(g, e1, v1));
assertTrue(Graphs.testIncidence(g, e1, v2));
assertFalse(Graphs.testIncidence(g, e1, v3));
assertEquals(v2, Graphs.getOppositeVertex(g, e1, v1));
assertEquals(v1, Graphs.getOppositeVertex(g, e1, v2));
assertEquals(
"([v1, v2, v3], [(v1,v2), (v2,v3), (v3,v1)])",
g.toString());
}
/**
* .
*/
public void testEdgesOf()
{
DirectedGraph<String, DefaultEdge> g =
createMultiTriangleWithMultiLoop();
assertEquals(3, g.edgesOf(v1).size());
assertEquals(2, g.edgesOf(v2).size());
}
/**
* .
*/
public void testGetAllEdges()
{
DirectedGraph<String, DefaultEdge> g =
createMultiTriangleWithMultiLoop();
Set<DefaultEdge> loops = g.getAllEdges(v1, v1);
assertEquals(1, loops.size());
}
/**
* .
*/
public void testInDegreeOf()
{
DirectedGraph<String, DefaultEdge> g =
createMultiTriangleWithMultiLoop();
assertEquals(2, g.inDegreeOf(v1));
assertEquals(1, g.inDegreeOf(v2));
}
/**
* .
*/
public void testOutDegreeOf()
{
DirectedGraph<String, DefaultEdge> g =
createMultiTriangleWithMultiLoop();
assertEquals(2, g.outDegreeOf(v1));
assertEquals(1, g.outDegreeOf(v2));
}
/**
* .
*/
public void testVertexOrderDeterminism()
{
DirectedGraph<String, DefaultEdge> g =
createMultiTriangleWithMultiLoop();
Iterator<String> iter = g.vertexSet().iterator();
assertEquals(v1, iter.next());
assertEquals(v2, iter.next());
assertEquals(v3, iter.next());
}
private DirectedGraph<String, DefaultEdge>
createMultiTriangleWithMultiLoop()
{
DirectedGraph<String, DefaultEdge> g =
new DirectedMultigraph<String, DefaultEdge>(
DefaultEdge.class);
initMultiTriangleWithMultiLoop(g);
return g;
}
private void initMultiTriangleWithMultiLoop(
DirectedGraph<String, DefaultEdge> g)
{
g.addVertex(v1);
g.addVertex(v2);
g.addVertex(v3);
g.addEdge(v1, v1);
g.addEdge(v1, v2);
g.addEdge(v2, v3);
g.addEdge(v3, v1);
}
//~ Inner Classes ----------------------------------------------------------
private static class LinkedHashSetFactory<V, E>
implements EdgeSetFactory<V, E>
{
/**
* .
*
* @param vertex
*
* @return an empty list.
*/
public Set<E> createEdgeSet(V vertex)
{
return new LinkedHashSet<E>();
}
}
}
// End DefaultDirectedGraphTest.java
|
