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
|
/* ==========================================
* 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.
*/
/* -----------------------------
* ClosestFirstIteratorTest.java
* -----------------------------
* (C) Copyright 2003-2008, by John V. Sichi and Contributors.
*
* Original Author: John V. Sichi
* Contributor(s): -
*
* $Id: ClosestFirstIteratorTest.java 645 2008-09-30 19:44:48Z perfecthash $
*
* Changes
* -------
* 03-Sep-2003 : Initial revision (JVS);
* 29-May-2005 : Test radius support (JVS);
*
*/
package org.jgrapht.traverse;
import org.jgrapht.*;
import org.jgrapht.graph.*;
/**
* Tests for ClosestFirstIterator.
*
* @author John V. Sichi
* @since Sep 3, 2003
*/
public class ClosestFirstIteratorTest
extends AbstractGraphIteratorTest
{
//~ Methods ----------------------------------------------------------------
/**
* .
*/
public void testRadius()
{
result = new StringBuffer();
DirectedGraph<String, DefaultEdge> graph = createDirectedGraph();
// NOTE: pick 301 as the radius because it discriminates
// the boundary case edge between v7 and v9
AbstractGraphIterator<String, ?> iterator =
new ClosestFirstIterator<String, DefaultEdge>(graph, "1", 301);
while (iterator.hasNext()) {
result.append(iterator.next());
if (iterator.hasNext()) {
result.append(',');
}
}
assertEquals("1,2,3,5,6,7", result.toString());
}
/**
* .
*/
public void testNoStart()
{
result = new StringBuffer();
DirectedGraph<String, DefaultEdge> graph = createDirectedGraph();
AbstractGraphIterator<String, ?> iterator =
new ClosestFirstIterator<String, DefaultEdge>(graph);
while (iterator.hasNext()) {
result.append(iterator.next());
if (iterator.hasNext()) {
result.append(',');
}
}
assertEquals("1,2,3,5,6,7,9,4,8,orphan", result.toString());
}
// NOTE: the edge weights make the result deterministic
String getExpectedStr1()
{
return "1,2,3,5,6,7,9,4,8";
}
String getExpectedStr2()
{
return getExpectedStr1() + ",orphan";
}
AbstractGraphIterator<String, DefaultEdge> createIterator(
DirectedGraph<String, DefaultEdge> g,
String vertex)
{
AbstractGraphIterator<String, DefaultEdge> i =
new ClosestFirstIterator<String, DefaultEdge>(g, vertex);
i.setCrossComponentTraversal(true);
return i;
}
}
// End ClosestFirstIteratorTest.java
|
