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
|
/* ==========================================
* 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.
*/
/* -----------------
* CompoundPermutationIterTest.java
* -----------------
* (C) Copyright 2005-2008, by Assaf Lehr and Contributors.
*
* Original Author: Assaf Lehr
* Contributor(s): -
*
* $Id: CompoundPermutationIterTest.java 645 2008-09-30 19:44:48Z perfecthash $
*
* Changes
* -------
*/
package org.jgrapht.experimental.permutation;
import java.util.*;
import junit.framework.*;
/**
* @author Assaf
* @since May 30, 2005
*/
public class CompoundPermutationIterTest
extends TestCase
{
//~ Instance fields --------------------------------------------------------
private CompoundPermutationIter complexPerm;
//~ Methods ----------------------------------------------------------------
/**
* Asserts that the number of permutations is the same as getMax. It also
* verifies that the number is the same when using different internal order
* of the permutation components. Note: The prints and timer can be unmarked
* to see performance results and the permutations array themselves.
*/
public void testGetNext()
{
// System.out.println("testing complex perm {1,1,1,2,2,3,4,5} ");
// StopperTimer timer = new StopperTimer();
// timer.start();
this.complexPerm =
new CompoundPermutationIter(
new int[] {
1,
1,
1,
2,
2,
3,
4,
5
});
int maxPermNum = this.complexPerm.getMax();
// System.out.println(Arrays.toString(this.complexPerm.getPermAsArray()));
int counter = 0;
while (this.complexPerm.hasNext()) {
int [] resultArray = this.complexPerm.getNext();
if (false) {
System.out.println(Arrays.toString(resultArray));
}
counter++;
}
// System.out.println(counter);
assertEquals(maxPermNum, counter);
// timer.stopAndReport();
// timer.start();
this.complexPerm =
new CompoundPermutationIter(
new int[] {
5,
4,
3,
2,
2,
1,
1,
1
});
// System.out.println("testing complex perm {5,4,3,2,2,1,1,1} ");
// System.out.println(Arrays.toString(this.complexPerm.getPermAsArray()));
counter = 0;
while (this.complexPerm.hasNext()) {
int [] resultArray = this.complexPerm.getNext();
if (false) {
System.out.println(Arrays.toString(resultArray));
}
counter++;
}
// System.out.println(counter);
assertEquals(maxPermNum, counter);
// timer.stopAndReport();
}
}
// End CompoundPermutationIterTest.java
|
