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
|
/* ==========================================
* 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.
*/
/* -------------------------
* KShortestPathKValuesTest.java
* -------------------------
* (C) Copyright 2007-2008, by France Telecom
*
* Original Author: Guillaume Boulmier and Contributors.
*
* $Id: KShortestPathKValuesTest.java 645 2008-09-30 19:44:48Z 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 KShortestPathKValuesTest
extends TestCase
{
//~ Methods ----------------------------------------------------------------
/**
* @param n
*
* @return n!.
*/
public static int factorial(int n)
{
int factorial = 1;
for (int i = 1; i <= n; i++) {
factorial *= i;
}
return factorial;
}
/**
* @param k
* @param n
*
* @return A(n,k).
*/
public static int permutation(int n, int k)
{
if (k <= n) {
return factorial(n) / factorial(n - k);
} else {
return 0;
}
}
public void testMaxSizeValue()
{
KShortestPathCompleteGraph6 graph = new KShortestPathCompleteGraph6();
for (
int maxSize = 1;
maxSize <= calculateNbElementaryPathsForCompleteGraph(6);
maxSize++)
{
KShortestPaths finder = new KShortestPaths(graph, "vS", maxSize);
assertEquals(finder.getPaths("v1").size(), maxSize);
assertEquals(finder.getPaths("v2").size(), maxSize);
assertEquals(finder.getPaths("v3").size(), maxSize);
assertEquals(finder.getPaths("v4").size(), maxSize);
assertEquals(finder.getPaths("v5").size(), maxSize);
}
}
public void testNbReturnedPaths()
{
KShortestPathCompleteGraph4 kSPCompleteGraph4 =
new KShortestPathCompleteGraph4();
verifyNbPathsForAllVertices(kSPCompleteGraph4);
KShortestPathCompleteGraph5 kSPCompleteGraph5 =
new KShortestPathCompleteGraph5();
verifyNbPathsForAllVertices(kSPCompleteGraph5);
KShortestPathCompleteGraph6 kSPCompleteGraph6 =
new KShortestPathCompleteGraph6();
verifyNbPathsForAllVertices(kSPCompleteGraph6);
}
private int calculateNbElementaryPathsForCompleteGraph(int n)
{
int nbPaths = 0;
for (int k = 1; k <= (n - 1); k++) {
nbPaths = nbPaths + permutation(n - 2, k - 1);
}
return nbPaths;
}
private void verifyNbPathsForAllVertices(Graph graph)
{
int nbpaths =
calculateNbElementaryPathsForCompleteGraph(
graph.vertexSet().size());
int maxSize = Integer.MAX_VALUE;
for (
Iterator sourceIterator = graph.vertexSet().iterator();
sourceIterator.hasNext();)
{
Object sourceVertex = sourceIterator.next();
KShortestPaths finder =
new KShortestPaths(graph, sourceVertex,
maxSize);
for (
Iterator targetIterator = graph.vertexSet().iterator();
targetIterator.hasNext();)
{
Object targetVertex = targetIterator.next();
if (targetVertex != sourceVertex) {
assertEquals(
finder.getPaths(targetVertex).size(),
nbpaths);
}
}
}
}
}
// End KShortestPathKValuesTest.java
|
