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
|
/* ==========================================
* 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.
*/
/* -----------------
* EquivalenceGroupCreatorTest.java
* -----------------
* (C) Copyright 2005-2008, by Assaf Lehr and Contributors.
*
* Original Author: Assaf Lehr
* Contributor(s): -
*
* $Id: EquivalenceGroupCreatorTest.java 645 2008-09-30 19:44:48Z perfecthash $
*
* Changes
* -------
*/
package org.jgrapht.experimental.equivalence;
import java.util.*;
import junit.framework.*;
import org.jgrapht.experimental.isomorphism.comparators.*;
/**
* @author Assaf
* @since Jul 22, 2005
*/
public class EquivalenceGroupCreatorTest
extends TestCase
{
//~ Instance fields --------------------------------------------------------
// create the groups array as 0 to X (it)
final int INTEGER_ARRAY_SIZE = 25;
//~ Methods ----------------------------------------------------------------
/*
* @see TestCase#setUp()
*/
protected void setUp()
throws Exception
{
super.setUp();
}
public void testUniformGroup()
{
// expecting two seperate groups , one with odd , one with even nubmers"
testOneComparator(new UniformEquivalenceComparator(), 1);
// " expecting 3 seperate groups , one for each mod3
testOneComparator(
new org.jgrapht.experimental.isomorphism.comparators.Mod3GroupComparator(),
3);
}
public void testOddEvenGroup()
{
// " expecting two seperate groups , one with odd , one with even
// nubmers");
testOneComparator(
new org.jgrapht.experimental.isomorphism.comparators.OddEvenGroupComparator(),
2);
// " expecting 3 seperate groups , one for each mod3");
testOneComparator(
new org.jgrapht.experimental.isomorphism.comparators.Mod3GroupComparator(),
3);
}
/**
* Using a chain of evenOdd(mod2) and mod3 comparator , should yield the 6
* groups , which are infact mod6 , examples:
* <li>mod2 = 0 , mod3 = 0 --> mod6=0 , like : 6 , 12
* <li>mod2 = 1 , mod3 = 0 --> mod6=1 , like : 7 , 13
* <li>
*/
public void testComparatorChain()
{
EquivalenceComparatorChain<Integer, Object> comparatorChain =
new EquivalenceComparatorChainBase<Integer, Object>(
new OddEvenGroupComparator());
comparatorChain.appendComparator(new Mod3GroupComparator());
// for (int i=0 ; i<INTEGER_ARRAY_SIZE ; i++)
// {
// System.out.println("hash of "+i+" =
// "+comparatorChain.equivalenceHashcode(integerArray[i], null));
//
//
// }
// expecting six seperate groups , with the different mod6 values");
testOneComparator(
comparatorChain,
6);
}
@SuppressWarnings("unchecked")
public void testComparatorChainSameComparatorTwice()
{
EquivalenceComparatorChain comparatorChain =
new EquivalenceComparatorChainBase(new OddEvenGroupComparator());
comparatorChain.appendComparator(new UniformEquivalenceComparator());
comparatorChain.appendComparator(new OddEvenGroupComparator());
// still expecting 2 groups "
testOneComparator(
comparatorChain,
2);
}
@SuppressWarnings("unchecked")
private void testOneComparator(
EquivalenceComparator comparator,
int expectedNumOfGroups)
{
ArrayList<Integer> integerArray =
new ArrayList<Integer>(INTEGER_ARRAY_SIZE);
for (int i = 0; i < INTEGER_ARRAY_SIZE; i++) {
integerArray.add(i);
}
EquivalenceSet [] eqGroupArray =
EquivalenceSetCreator.createEqualityGroupOrderedArray(
integerArray,
comparator,
null);
assertEquals(expectedNumOfGroups, eqGroupArray.length);
// assert the group order size is sorted.
for (int i = 1; i < eqGroupArray.length; i++) {
EquivalenceSet set = eqGroupArray[i];
assertTrue(set.size() >= eqGroupArray[i - 1].size());
}
// System.out.println("\nTesting the EquivalenceSet[] returned from
// Integer["
// +INTEGER_ARRAY_SIZE+"] filled with the integers as the indexes. \n"
// + expectedResult);
// System.out.println("result size="+eqGroupArray.length);
// for (int i = 0; i < eqGroupArray.length; i++) {
// System.out.println(eqGroupArray[i]);
// }
}
}
// End EquivalenceGroupCreatorTest.java
|