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
|
/* ==========================================
* 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.
*/
/* -------------------------
* KShortestPathCostTest.java
* -------------------------
* (C) Copyright 2007-2008, by France Telecom
*
* Original Author: Guillaume Boulmier and Contributors.
*
* $Id: KShortestPathCostTest.java 680 2009-05-25 05:55:31Z perfecthash $
*
* Changes
* -------
* 05-Jun-2007 : Initial revision (GB);
*
*/
package org.jgrapht.alg;
import java.util.*;
import junit.framework.*;
import org.jgrapht.*;
/**
* @author Guillaume Boulmier
* @since July 5, 2007
*/
@SuppressWarnings("unchecked")
public class KShortestPathCostTest
extends TestCase
{
//~ Methods ----------------------------------------------------------------
public void testKShortestPathCompleteGraph4()
{
int nbPaths = 5;
KShortestPathCompleteGraph4 graph = new KShortestPathCompleteGraph4();
KShortestPaths pathFinder = new KShortestPaths(graph, "vS", nbPaths);
List pathElements = pathFinder.getPaths("v3");
assertEquals(
"[[(vS : v1), (v1 : v3)], [(vS : v2), (v2 : v3)],"
+ " [(vS : v2), (v1 : v2), (v1 : v3)], "
+ "[(vS : v1), (v1 : v2), (v2 : v3)], "
+ "[(vS : v3)]]",
pathElements.toString());
assertEquals(5, pathElements.size(), 0);
GraphPath pathElement = (GraphPath) pathElements.get(0);
assertEquals(2, pathElement.getWeight(), 0);
assertEquals(
Arrays.asList(new Object[] { graph.eS1, graph.e13 }),
pathElement.getEdgeList());
}
public void testKShortestPathCosts(Graph graph)
{
int maxSize = 20;
for (
Iterator sourceIterator = graph.vertexSet().iterator();
sourceIterator.hasNext();)
{
Object sourceVertex = sourceIterator.next();
for (
Iterator targetIterator = graph.vertexSet().iterator();
targetIterator.hasNext();)
{
Object targetVertex = targetIterator.next();
if (targetVertex != sourceVertex) {
KShortestPaths pathFinder =
new KShortestPaths(graph,
sourceVertex, maxSize);
List pathElements = pathFinder.getPaths(targetVertex);
GraphPath pathElement = (GraphPath) pathElements.get(0);
double lastCost = pathElement.getWeight();
for (int i = 0; i < pathElements.size(); i++) {
pathElement = (GraphPath) pathElements.get(i);
double cost = pathElement.getWeight();
assertTrue(lastCost <= cost);
lastCost = cost;
}
assertTrue(pathElements.size() <= maxSize);
}
}
}
}
public void testPicture1Graph()
{
Picture1Graph picture1Graph = new Picture1Graph();
int maxSize = 10;
KShortestPaths pathFinder =
new KShortestPaths(picture1Graph, "vS",
maxSize);
assertEquals(2, pathFinder.getPaths("v5").size());
List pathElements = pathFinder.getPaths("v5");
GraphPath pathElement = (GraphPath) pathElements.get(0);
assertEquals(
Arrays.asList(
new Object[] {
picture1Graph.eS1,
picture1Graph.e15
}),
pathElement.getEdgeList());
List vertices = Graphs.getPathVertexList(pathElement);
assertEquals(
Arrays.asList(
new Object[] {
"vS",
"v1",
"v5"
}),
vertices);
pathElement = (GraphPath) pathElements.get(1);
assertEquals(
Arrays.asList(
new Object[] {
picture1Graph.eS2,
picture1Graph.e25
}),
pathElement.getEdgeList());
vertices = Graphs.getPathVertexList(pathElement);
assertEquals(
Arrays.asList(
new Object[] {
"vS",
"v2",
"v5"
}),
vertices);
pathElements = pathFinder.getPaths("v7");
pathElement = (GraphPath) pathElements.get(0);
double lastCost = pathElement.getWeight();
for (int i = 0; i < pathElements.size(); i++) {
pathElement = (GraphPath) pathElements.get(i);
double cost = pathElement.getWeight();
assertTrue(lastCost <= cost);
lastCost = cost;
}
}
}
// End KShortestPathCostTest.java
|
