Synching with the latest copy. Everything works, and the
tests all run. . . git-svn-id: https://svn.apache.org/repos/asf/jakarta/commons/sandbox/graph2/trunk@144618 13f79535-47bb-0310-9956-ffa450edef68
This commit is contained in:
ddp committed
1 parent
736eca0009
commit
0235babc8b
6 files changed
+3192
-3112
No files matched your search
@@ -1,478 +1,478 @@
|
||||
package org.apache.commons.graph;
|
||||
|
||||
/* ====================================================================
|
||||
* The Apache Software License, Version 1.1
|
||||
*
|
||||
* Copyright (c) 2001 The Apache Software Foundation. All rights
|
||||
* reserved.
|
||||
*
|
||||
* Redistribution and use in source and binary forms, with or without
|
||||
* modification, are permitted provided that the following conditions
|
||||
* are met:
|
||||
*
|
||||
* 1. Redistributions of source code must retain the above copyright
|
||||
* notice, this list of conditions and the following disclaimer.
|
||||
*
|
||||
* 2. Redistributions in binary form must reproduce the above copyright
|
||||
* notice, this list of conditions and the following disclaimer in
|
||||
* the documentation and/or other materials provided with the
|
||||
* distribution.
|
||||
*
|
||||
* 3. The end-user documentation included with the redistribution,
|
||||
* if any, must include the following acknowledgment:
|
||||
* "This product includes software developed by the
|
||||
* Apache Software Foundation (http://www.apache.org/)."
|
||||
* Alternately, this acknowledgment may appear in the software itself,
|
||||
* if and wherever such third-party acknowledgments normally appear.
|
||||
*
|
||||
* 4. The names "Apache" and "Apache Software Foundation" and
|
||||
* "Commons" must not be used to endorse or promote products
|
||||
* derived from this software without prior written permission. For
|
||||
* written permission, please contact apache@apache.org.
|
||||
*
|
||||
* 5. Products derived from this software may not be called "Apache",
|
||||
* "Commons", nor may "Apache" appear in their name, without
|
||||
* prior written permission of the Apache Software Foundation.
|
||||
*
|
||||
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED
|
||||
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
||||
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
||||
* DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR
|
||||
* ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
||||
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
|
||||
* USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
|
||||
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
||||
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
|
||||
* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
||||
* SUCH DAMAGE.
|
||||
* ====================================================================
|
||||
*
|
||||
* This software consists of voluntary contributions made by many
|
||||
* individuals on behalf of the Apache Software Foundation. For more
|
||||
* information on the Apache Software Foundation, please see
|
||||
* <http://www.apache.org/>.
|
||||
*/
|
||||
|
||||
/**
|
||||
* DirGraphTest This test will ensure that we can represent a Directed Graph.
|
||||
*/
|
||||
|
||||
import java.util.Set;
|
||||
import java.util.HashSet;
|
||||
import java.util.Iterator;
|
||||
|
||||
/**
|
||||
* Description of the Class
|
||||
*/
|
||||
public class DirGraphTest
|
||||
extends GraphTest
|
||||
{
|
||||
private String testName = null;
|
||||
|
||||
/**
|
||||
* Constructor for the DirGraphTest object
|
||||
*
|
||||
* @param name
|
||||
*/
|
||||
public DirGraphTest(String name)
|
||||
{
|
||||
super(name);
|
||||
this.testName = name;
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testDirNull()
|
||||
throws Throwable
|
||||
{
|
||||
verifyGraph(makeDirNullGraph(), 0, 0);
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testSingleVertex()
|
||||
throws Throwable
|
||||
{
|
||||
verifyGraph(makeDirSingleVertex(), 1, 0);
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testDoubleVertex()
|
||||
throws Throwable
|
||||
{
|
||||
verifyGraph(makeDirDoubleVertex(), 2, 0);
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testSelfLoop()
|
||||
throws Throwable
|
||||
{
|
||||
DirectedGraph IUT = makeSelfLoop();
|
||||
try
|
||||
{
|
||||
|
||||
verifyGraph(IUT, 1, 1);
|
||||
|
||||
verifyAdjVertices(IUT, V1,
|
||||
makeSet(V1));
|
||||
|
||||
verifyAdjVertices(IUT, V1,
|
||||
makeSet(V1),
|
||||
makeSet(V1));
|
||||
}
|
||||
catch (Throwable t)
|
||||
{
|
||||
printGraph(t, IUT);
|
||||
throw t;
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testDirectedEdge()
|
||||
throws Throwable
|
||||
{
|
||||
DirectedGraph IUT = makeDirectedEdge();
|
||||
try
|
||||
{
|
||||
|
||||
verifyGraph(IUT, 2, 1);
|
||||
|
||||
verifyAdjVertices(IUT, V1,
|
||||
makeSet(V1, V2));
|
||||
verifyAdjVertices(IUT, V1,
|
||||
makeSet(V1, V2));
|
||||
|
||||
verifyAdjVertices(IUT, V1,
|
||||
makeSet(),
|
||||
makeSet(V2));
|
||||
verifyAdjVertices(IUT, V2,
|
||||
makeSet(V1),
|
||||
makeSet());
|
||||
}
|
||||
catch (Throwable t)
|
||||
{
|
||||
printGraph(t, IUT);
|
||||
throw t;
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testDirParallelEdges()
|
||||
throws Throwable
|
||||
{
|
||||
DirectedGraph IUT = makeDirParallelEdges();
|
||||
try
|
||||
{
|
||||
|
||||
verifyGraph(IUT, 2, 2);
|
||||
|
||||
verifyAdjVertices(IUT, V1,
|
||||
makeSet(V1, V2));
|
||||
verifyAdjVertices(IUT, V2,
|
||||
makeSet(V1, V2));
|
||||
|
||||
verifyAdjVertices(IUT, V1,
|
||||
makeSet(),
|
||||
makeSet(V2));
|
||||
verifyAdjVertices(IUT, V2,
|
||||
makeSet(V1),
|
||||
makeSet());
|
||||
|
||||
}
|
||||
catch (Throwable t)
|
||||
{
|
||||
printGraph(t, IUT);
|
||||
throw t;
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testTwoCycle()
|
||||
throws Throwable
|
||||
{
|
||||
DirectedGraph IUT = makeTwoCycle();
|
||||
try
|
||||
{
|
||||
|
||||
verifyGraph(IUT, 2, 2);
|
||||
|
||||
verifyAdjVertices(IUT, V1,
|
||||
makeSet(V1, V2));
|
||||
verifyAdjVertices(IUT, V2,
|
||||
makeSet(V1, V2));
|
||||
|
||||
verifyAdjVertices(IUT, V1,
|
||||
makeSet(V2),
|
||||
makeSet(V2));
|
||||
verifyAdjVertices(IUT, V2,
|
||||
makeSet(V1),
|
||||
makeSet(V1));
|
||||
}
|
||||
catch (Throwable t)
|
||||
{
|
||||
printGraph(t, IUT);
|
||||
throw t;
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testDirectedCycle()
|
||||
throws Throwable
|
||||
{
|
||||
DirectedGraph IUT = makeDirectedCycle();
|
||||
try
|
||||
{
|
||||
|
||||
verifyGraph(IUT, 3, 3);
|
||||
|
||||
verifyAdjVertices(IUT, V1,
|
||||
makeSet(V1, V2, V3));
|
||||
verifyAdjVertices(IUT, V2,
|
||||
makeSet(V1, V2, V3));
|
||||
verifyAdjVertices(IUT, V3,
|
||||
makeSet(V1, V2, V3));
|
||||
|
||||
verifyAdjVertices(IUT, V1,
|
||||
makeSet(V3),
|
||||
makeSet(V2));
|
||||
verifyAdjVertices(IUT, V2,
|
||||
makeSet(V1),
|
||||
makeSet(V3));
|
||||
verifyAdjVertices(IUT, V3,
|
||||
makeSet(V2),
|
||||
makeSet(V1));
|
||||
}
|
||||
catch (Throwable t)
|
||||
{
|
||||
printGraph(t, IUT);
|
||||
throw t;
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testPipe()
|
||||
throws Throwable
|
||||
{
|
||||
DirectedGraph IUT = makePipe();
|
||||
try
|
||||
{
|
||||
|
||||
verifyGraph(IUT, 3, 2);
|
||||
|
||||
verifyAdjVertices(IUT, V1,
|
||||
makeSet(V1, V2));
|
||||
verifyAdjVertices(IUT, V2,
|
||||
makeSet(V1, V2, V3));
|
||||
verifyAdjVertices(IUT, V3,
|
||||
makeSet(V2, V3));
|
||||
|
||||
verifyAdjVertices(IUT, V1,
|
||||
makeSet(),
|
||||
makeSet(V2));
|
||||
verifyAdjVertices(IUT, V2,
|
||||
makeSet(V1),
|
||||
makeSet(V3));
|
||||
verifyAdjVertices(IUT, V3,
|
||||
makeSet(V2),
|
||||
makeSet());
|
||||
}
|
||||
catch (Throwable t)
|
||||
{
|
||||
printGraph(t, IUT);
|
||||
throw t;
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testDiamond()
|
||||
throws Throwable
|
||||
{
|
||||
DirectedGraph IUT = makeDiamond();
|
||||
try
|
||||
{
|
||||
|
||||
verifyGraph(IUT, 4, 4);
|
||||
|
||||
verifyAdjVertices(IUT, V1,
|
||||
makeSet(V1, V2, V3));
|
||||
verifyAdjVertices(IUT, V2,
|
||||
makeSet(V1, V2, V4));
|
||||
verifyAdjVertices(IUT, V3,
|
||||
makeSet(V1, V3, V4));
|
||||
verifyAdjVertices(IUT, V4,
|
||||
makeSet(V2, V3, V4));
|
||||
|
||||
verifyAdjVertices(IUT, V1,
|
||||
makeSet(),
|
||||
makeSet(V2, V3));
|
||||
verifyAdjVertices(IUT, V2,
|
||||
makeSet(V1),
|
||||
makeSet(V4));
|
||||
verifyAdjVertices(IUT, V3,
|
||||
makeSet(V1),
|
||||
makeSet(V4));
|
||||
verifyAdjVertices(IUT, V4,
|
||||
makeSet(V2, V3),
|
||||
makeSet());
|
||||
}
|
||||
catch (Throwable t)
|
||||
{
|
||||
printGraph(t, IUT);
|
||||
throw t;
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testPipelessCycle()
|
||||
throws Throwable
|
||||
{
|
||||
DirectedGraph IUT = makePipelessCycle();
|
||||
try
|
||||
{
|
||||
|
||||
verifyGraph(IUT, 4, 4);
|
||||
|
||||
verifyAdjVertices(IUT, V1,
|
||||
makeSet(V1, V2, V3));
|
||||
verifyAdjVertices(IUT, V2,
|
||||
makeSet(V1, V2, V4));
|
||||
verifyAdjVertices(IUT, V3,
|
||||
makeSet(V1, V3, V4));
|
||||
verifyAdjVertices(IUT, V4,
|
||||
makeSet(V2, V3, V4));
|
||||
|
||||
verifyAdjVertices(IUT, V1,
|
||||
makeSet(),
|
||||
makeSet(V2, V3));
|
||||
verifyAdjVertices(IUT, V2,
|
||||
makeSet(V1, V4),
|
||||
makeSet());
|
||||
verifyAdjVertices(IUT, V3,
|
||||
makeSet(V1, V4),
|
||||
makeSet());
|
||||
verifyAdjVertices(IUT, V4,
|
||||
makeSet(),
|
||||
makeSet(V2, V3));
|
||||
}
|
||||
catch (Throwable t)
|
||||
{
|
||||
printGraph(t, IUT);
|
||||
throw t;
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testParentTree()
|
||||
throws Throwable
|
||||
{
|
||||
DirectedGraph IUT = makeParentTree();
|
||||
try
|
||||
{
|
||||
|
||||
verifyGraph(IUT, 5, 4);
|
||||
|
||||
verifyAdjVertices(IUT, V1,
|
||||
makeSet(V1, V2, V3));
|
||||
verifyAdjVertices(IUT, V2,
|
||||
makeSet(V1, V2));
|
||||
verifyAdjVertices(IUT, V3,
|
||||
makeSet(V1, V3, V4, V5));
|
||||
verifyAdjVertices(IUT, V4,
|
||||
makeSet(V3, V4));
|
||||
verifyAdjVertices(IUT, V5,
|
||||
makeSet(V3, V5));
|
||||
|
||||
verifyAdjVertices(IUT, V1,
|
||||
makeSet(V2, V3),
|
||||
makeSet());
|
||||
verifyAdjVertices(IUT, V2,
|
||||
makeSet(),
|
||||
makeSet(V1));
|
||||
verifyAdjVertices(IUT, V3,
|
||||
makeSet(V4, V5),
|
||||
makeSet(V1));
|
||||
verifyAdjVertices(IUT, V4,
|
||||
makeSet(),
|
||||
makeSet(V3));
|
||||
verifyAdjVertices(IUT, V5,
|
||||
makeSet(),
|
||||
makeSet(V3));
|
||||
}
|
||||
catch (Throwable t)
|
||||
{
|
||||
printGraph(t, IUT);
|
||||
throw t;
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testChildTree()
|
||||
throws Throwable
|
||||
{
|
||||
DirectedGraph IUT = makeChildTree();
|
||||
try
|
||||
{
|
||||
|
||||
verifyGraph(IUT, 5, 4);
|
||||
|
||||
verifyAdjVertices(IUT, V1,
|
||||
makeSet(V1, V2, V3));
|
||||
verifyAdjVertices(IUT, V2,
|
||||
makeSet(V1, V2));
|
||||
verifyAdjVertices(IUT, V3,
|
||||
makeSet(V1, V3, V4, V5));
|
||||
verifyAdjVertices(IUT, V4,
|
||||
makeSet(V3, V4));
|
||||
verifyAdjVertices(IUT, V5,
|
||||
makeSet(V3, V5));
|
||||
|
||||
verifyAdjVertices(IUT, V1,
|
||||
makeSet(),
|
||||
makeSet(V2, V3));
|
||||
verifyAdjVertices(IUT, V2,
|
||||
makeSet(V1),
|
||||
makeSet());
|
||||
verifyAdjVertices(IUT, V3,
|
||||
makeSet(V1),
|
||||
makeSet(V4, V5));
|
||||
verifyAdjVertices(IUT, V4,
|
||||
makeSet(V3),
|
||||
makeSet());
|
||||
verifyAdjVertices(IUT, V5,
|
||||
makeSet(V3),
|
||||
makeSet());
|
||||
}
|
||||
catch (Throwable t)
|
||||
{
|
||||
printGraph(t, IUT);
|
||||
throw t;
|
||||
}
|
||||
}
|
||||
|
||||
}
|
||||
package org.apache.commons.graph;
|
||||
|
||||
/* ====================================================================
|
||||
* The Apache Software License, Version 1.1
|
||||
*
|
||||
* Copyright (c) 2001 The Apache Software Foundation. All rights
|
||||
* reserved.
|
||||
*
|
||||
* Redistribution and use in source and binary forms, with or without
|
||||
* modification, are permitted provided that the following conditions
|
||||
* are met:
|
||||
*
|
||||
* 1. Redistributions of source code must retain the above copyright
|
||||
* notice, this list of conditions and the following disclaimer.
|
||||
*
|
||||
* 2. Redistributions in binary form must reproduce the above copyright
|
||||
* notice, this list of conditions and the following disclaimer in
|
||||
* the documentation and/or other materials provided with the
|
||||
* distribution.
|
||||
*
|
||||
* 3. The end-user documentation included with the redistribution,
|
||||
* if any, must include the following acknowledgment:
|
||||
* "This product includes software developed by the
|
||||
* Apache Software Foundation (http://www.apache.org/)."
|
||||
* Alternately, this acknowledgment may appear in the software itself,
|
||||
* if and wherever such third-party acknowledgments normally appear.
|
||||
*
|
||||
* 4. The names "Apache" and "Apache Software Foundation" and
|
||||
* "Commons" must not be used to endorse or promote products
|
||||
* derived from this software without prior written permission. For
|
||||
* written permission, please contact apache@apache.org.
|
||||
*
|
||||
* 5. Products derived from this software may not be called "Apache",
|
||||
* "Commons", nor may "Apache" appear in their name, without
|
||||
* prior written permission of the Apache Software Foundation.
|
||||
*
|
||||
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED
|
||||
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
||||
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
||||
* DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR
|
||||
* ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
||||
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
|
||||
* USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
|
||||
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
||||
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
|
||||
* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
||||
* SUCH DAMAGE.
|
||||
* ====================================================================
|
||||
*
|
||||
* This software consists of voluntary contributions made by many
|
||||
* individuals on behalf of the Apache Software Foundation. For more
|
||||
* information on the Apache Software Foundation, please see
|
||||
* <http://www.apache.org/>.
|
||||
*/
|
||||
|
||||
/**
|
||||
* DirGraphTest This test will ensure that we can represent a Directed Graph.
|
||||
*/
|
||||
|
||||
import java.util.Set;
|
||||
import java.util.HashSet;
|
||||
import java.util.Iterator;
|
||||
|
||||
/**
|
||||
* Description of the Class
|
||||
*/
|
||||
public class DirGraphTest
|
||||
extends GraphTest
|
||||
{
|
||||
private String testName = null;
|
||||
|
||||
/**
|
||||
* Constructor for the DirGraphTest object
|
||||
*
|
||||
* @param name
|
||||
*/
|
||||
public DirGraphTest(String name)
|
||||
{
|
||||
super(name);
|
||||
this.testName = name;
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testDirNull()
|
||||
throws Throwable
|
||||
{
|
||||
verifyGraph(makeDirNullGraph(), 0, 0);
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testSingleVertex()
|
||||
throws Throwable
|
||||
{
|
||||
verifyGraph(makeDirSingleVertex(), 1, 0);
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testDoubleVertex()
|
||||
throws Throwable
|
||||
{
|
||||
verifyGraph(makeDirDoubleVertex(), 2, 0);
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testSelfLoop()
|
||||
throws Throwable
|
||||
{
|
||||
DirectedGraph IUT = makeSelfLoop();
|
||||
try
|
||||
{
|
||||
|
||||
verifyGraph(IUT, 1, 1);
|
||||
|
||||
verifyAdjVertices(IUT, V1,
|
||||
makeSet(V1));
|
||||
|
||||
verifyAdjVertices(IUT, V1,
|
||||
makeSet(V1),
|
||||
makeSet(V1));
|
||||
}
|
||||
catch (Throwable t)
|
||||
{
|
||||
printGraph(t, IUT);
|
||||
throw t;
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testDirectedEdge()
|
||||
throws Throwable
|
||||
{
|
||||
DirectedGraph IUT = makeDirectedEdge();
|
||||
try
|
||||
{
|
||||
|
||||
verifyGraph(IUT, 2, 1);
|
||||
|
||||
verifyAdjVertices(IUT, V1,
|
||||
makeSet(V1, V2));
|
||||
verifyAdjVertices(IUT, V1,
|
||||
makeSet(V1, V2));
|
||||
|
||||
verifyAdjVertices(IUT, V1,
|
||||
makeSet(),
|
||||
makeSet(V2));
|
||||
verifyAdjVertices(IUT, V2,
|
||||
makeSet(V1),
|
||||
makeSet());
|
||||
}
|
||||
catch (Throwable t)
|
||||
{
|
||||
printGraph(t, IUT);
|
||||
throw t;
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testDirParallelEdges()
|
||||
throws Throwable
|
||||
{
|
||||
DirectedGraph IUT = makeDirParallelEdges();
|
||||
try
|
||||
{
|
||||
|
||||
verifyGraph(IUT, 2, 2);
|
||||
|
||||
verifyAdjVertices(IUT, V1,
|
||||
makeSet(V1, V2));
|
||||
verifyAdjVertices(IUT, V2,
|
||||
makeSet(V1, V2));
|
||||
|
||||
verifyAdjVertices(IUT, V1,
|
||||
makeSet(),
|
||||
makeSet(V2));
|
||||
verifyAdjVertices(IUT, V2,
|
||||
makeSet(V1),
|
||||
makeSet());
|
||||
|
||||
}
|
||||
catch (Throwable t)
|
||||
{
|
||||
printGraph(t, IUT);
|
||||
throw t;
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testTwoCycle()
|
||||
throws Throwable
|
||||
{
|
||||
DirectedGraph IUT = makeTwoCycle();
|
||||
try
|
||||
{
|
||||
|
||||
verifyGraph(IUT, 2, 2);
|
||||
|
||||
verifyAdjVertices(IUT, V1,
|
||||
makeSet(V1, V2));
|
||||
verifyAdjVertices(IUT, V2,
|
||||
makeSet(V1, V2));
|
||||
|
||||
verifyAdjVertices(IUT, V1,
|
||||
makeSet(V2),
|
||||
makeSet(V2));
|
||||
verifyAdjVertices(IUT, V2,
|
||||
makeSet(V1),
|
||||
makeSet(V1));
|
||||
}
|
||||
catch (Throwable t)
|
||||
{
|
||||
printGraph(t, IUT);
|
||||
throw t;
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testDirectedCycle()
|
||||
throws Throwable
|
||||
{
|
||||
DirectedGraph IUT = makeDirectedCycle();
|
||||
try
|
||||
{
|
||||
|
||||
verifyGraph(IUT, 3, 3);
|
||||
|
||||
verifyAdjVertices(IUT, V1,
|
||||
makeSet(V1, V2, V3));
|
||||
verifyAdjVertices(IUT, V2,
|
||||
makeSet(V1, V2, V3));
|
||||
verifyAdjVertices(IUT, V3,
|
||||
makeSet(V1, V2, V3));
|
||||
|
||||
verifyAdjVertices(IUT, V1,
|
||||
makeSet(V3),
|
||||
makeSet(V2));
|
||||
verifyAdjVertices(IUT, V2,
|
||||
makeSet(V1),
|
||||
makeSet(V3));
|
||||
verifyAdjVertices(IUT, V3,
|
||||
makeSet(V2),
|
||||
makeSet(V1));
|
||||
}
|
||||
catch (Throwable t)
|
||||
{
|
||||
printGraph(t, IUT);
|
||||
throw t;
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testPipe()
|
||||
throws Throwable
|
||||
{
|
||||
DirectedGraph IUT = makePipe();
|
||||
try
|
||||
{
|
||||
|
||||
verifyGraph(IUT, 3, 2);
|
||||
|
||||
verifyAdjVertices(IUT, V1,
|
||||
makeSet(V1, V2));
|
||||
verifyAdjVertices(IUT, V2,
|
||||
makeSet(V1, V2, V3));
|
||||
verifyAdjVertices(IUT, V3,
|
||||
makeSet(V2, V3));
|
||||
|
||||
verifyAdjVertices(IUT, V1,
|
||||
makeSet(),
|
||||
makeSet(V2));
|
||||
verifyAdjVertices(IUT, V2,
|
||||
makeSet(V1),
|
||||
makeSet(V3));
|
||||
verifyAdjVertices(IUT, V3,
|
||||
makeSet(V2),
|
||||
makeSet());
|
||||
}
|
||||
catch (Throwable t)
|
||||
{
|
||||
printGraph(t, IUT);
|
||||
throw t;
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testDiamond()
|
||||
throws Throwable
|
||||
{
|
||||
DirectedGraph IUT = makeDiamond();
|
||||
try
|
||||
{
|
||||
|
||||
verifyGraph(IUT, 4, 4);
|
||||
|
||||
verifyAdjVertices(IUT, V1,
|
||||
makeSet(V1, V2, V3));
|
||||
verifyAdjVertices(IUT, V2,
|
||||
makeSet(V1, V2, V4));
|
||||
verifyAdjVertices(IUT, V3,
|
||||
makeSet(V1, V3, V4));
|
||||
verifyAdjVertices(IUT, V4,
|
||||
makeSet(V2, V3, V4));
|
||||
|
||||
verifyAdjVertices(IUT, V1,
|
||||
makeSet(),
|
||||
makeSet(V2, V3));
|
||||
verifyAdjVertices(IUT, V2,
|
||||
makeSet(V1),
|
||||
makeSet(V4));
|
||||
verifyAdjVertices(IUT, V3,
|
||||
makeSet(V1),
|
||||
makeSet(V4));
|
||||
verifyAdjVertices(IUT, V4,
|
||||
makeSet(V2, V3),
|
||||
makeSet());
|
||||
}
|
||||
catch (Throwable t)
|
||||
{
|
||||
printGraph(t, IUT);
|
||||
throw t;
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testPipelessCycle()
|
||||
throws Throwable
|
||||
{
|
||||
DirectedGraph IUT = makePipelessCycle();
|
||||
try
|
||||
{
|
||||
|
||||
verifyGraph(IUT, 4, 4);
|
||||
|
||||
verifyAdjVertices(IUT, V1,
|
||||
makeSet(V1, V2, V3));
|
||||
verifyAdjVertices(IUT, V2,
|
||||
makeSet(V1, V2, V4));
|
||||
verifyAdjVertices(IUT, V3,
|
||||
makeSet(V1, V3, V4));
|
||||
verifyAdjVertices(IUT, V4,
|
||||
makeSet(V2, V3, V4));
|
||||
|
||||
verifyAdjVertices(IUT, V1,
|
||||
makeSet(),
|
||||
makeSet(V2, V3));
|
||||
verifyAdjVertices(IUT, V2,
|
||||
makeSet(V1, V4),
|
||||
makeSet());
|
||||
verifyAdjVertices(IUT, V3,
|
||||
makeSet(V1, V4),
|
||||
makeSet());
|
||||
verifyAdjVertices(IUT, V4,
|
||||
makeSet(),
|
||||
makeSet(V2, V3));
|
||||
}
|
||||
catch (Throwable t)
|
||||
{
|
||||
printGraph(t, IUT);
|
||||
throw t;
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testParentTree()
|
||||
throws Throwable
|
||||
{
|
||||
DirectedGraph IUT = makeParentTree();
|
||||
try
|
||||
{
|
||||
|
||||
verifyGraph(IUT, 5, 4);
|
||||
|
||||
verifyAdjVertices(IUT, V1,
|
||||
makeSet(V1, V2, V3));
|
||||
verifyAdjVertices(IUT, V2,
|
||||
makeSet(V1, V2));
|
||||
verifyAdjVertices(IUT, V3,
|
||||
makeSet(V1, V3, V4, V5));
|
||||
verifyAdjVertices(IUT, V4,
|
||||
makeSet(V3, V4));
|
||||
verifyAdjVertices(IUT, V5,
|
||||
makeSet(V3, V5));
|
||||
|
||||
verifyAdjVertices(IUT, V1,
|
||||
makeSet(V2, V3),
|
||||
makeSet());
|
||||
verifyAdjVertices(IUT, V2,
|
||||
makeSet(),
|
||||
makeSet(V1));
|
||||
verifyAdjVertices(IUT, V3,
|
||||
makeSet(V4, V5),
|
||||
makeSet(V1));
|
||||
verifyAdjVertices(IUT, V4,
|
||||
makeSet(),
|
||||
makeSet(V3));
|
||||
verifyAdjVertices(IUT, V5,
|
||||
makeSet(),
|
||||
makeSet(V3));
|
||||
}
|
||||
catch (Throwable t)
|
||||
{
|
||||
printGraph(t, IUT);
|
||||
throw t;
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testChildTree()
|
||||
throws Throwable
|
||||
{
|
||||
DirectedGraph IUT = makeChildTree();
|
||||
try
|
||||
{
|
||||
|
||||
verifyGraph(IUT, 5, 4);
|
||||
|
||||
verifyAdjVertices(IUT, V1,
|
||||
makeSet(V1, V2, V3));
|
||||
verifyAdjVertices(IUT, V2,
|
||||
makeSet(V1, V2));
|
||||
verifyAdjVertices(IUT, V3,
|
||||
makeSet(V1, V3, V4, V5));
|
||||
verifyAdjVertices(IUT, V4,
|
||||
makeSet(V3, V4));
|
||||
verifyAdjVertices(IUT, V5,
|
||||
makeSet(V3, V5));
|
||||
|
||||
verifyAdjVertices(IUT, V1,
|
||||
makeSet(),
|
||||
makeSet(V2, V3));
|
||||
verifyAdjVertices(IUT, V2,
|
||||
makeSet(V1),
|
||||
makeSet());
|
||||
verifyAdjVertices(IUT, V3,
|
||||
makeSet(V1),
|
||||
makeSet(V4, V5));
|
||||
verifyAdjVertices(IUT, V4,
|
||||
makeSet(V3),
|
||||
makeSet());
|
||||
verifyAdjVertices(IUT, V5,
|
||||
makeSet(V3),
|
||||
makeSet());
|
||||
}
|
||||
catch (Throwable t)
|
||||
{
|
||||
printGraph(t, IUT);
|
||||
throw t;
|
||||
}
|
||||
}
|
||||
|
||||
}
|
||||
File diff suppressed because it is too large.
Load diff
@@ -1,379 +1,379 @@
|
||||
package org.apache.commons.graph;
|
||||
|
||||
/* ====================================================================
|
||||
* The Apache Software License, Version 1.1
|
||||
*
|
||||
* Copyright (c) 2001 The Apache Software Foundation. All rights
|
||||
* reserved.
|
||||
*
|
||||
* Redistribution and use in source and binary forms, with or without
|
||||
* modification, are permitted provided that the following conditions
|
||||
* are met:
|
||||
*
|
||||
* 1. Redistributions of source code must retain the above copyright
|
||||
* notice, this list of conditions and the following disclaimer.
|
||||
*
|
||||
* 2. Redistributions in binary form must reproduce the above copyright
|
||||
* notice, this list of conditions and the following disclaimer in
|
||||
* the documentation and/or other materials provided with the
|
||||
* distribution.
|
||||
*
|
||||
* 3. The end-user documentation included with the redistribution,
|
||||
* if any, must include the following acknowledgment:
|
||||
* "This product includes software developed by the
|
||||
* Apache Software Foundation (http://www.apache.org/)."
|
||||
* Alternately, this acknowledgment may appear in the software itself,
|
||||
* if and wherever such third-party acknowledgments normally appear.
|
||||
*
|
||||
* 4. The names "Apache" and "Apache Software Foundation" and
|
||||
* "Commons" must not be used to endorse or promote products
|
||||
* derived from this software without prior written permission. For
|
||||
* written permission, please contact apache@apache.org.
|
||||
*
|
||||
* 5. Products derived from this software may not be called "Apache",
|
||||
* "Commons", nor may "Apache" appear in their name, without
|
||||
* prior written permission of the Apache Software Foundation.
|
||||
*
|
||||
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED
|
||||
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
||||
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
||||
* DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR
|
||||
* ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
||||
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
|
||||
* USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
|
||||
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
||||
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
|
||||
* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
||||
* SUCH DAMAGE.
|
||||
* ====================================================================
|
||||
*
|
||||
* This software consists of voluntary contributions made by many
|
||||
* individuals on behalf of the Apache Software Foundation. For more
|
||||
* information on the Apache Software Foundation, please see
|
||||
* <http://www.apache.org/>.
|
||||
*/
|
||||
/**
|
||||
* GraphTest This test will ensure that we can indeed represent a graph. We will
|
||||
* implement the following graphs. () No Vertex, No Edges @ One Vertex, No Edges
|
||||
* @ @ Two Vertices, No Edges @-@ Two Vertices, One edge /-\ @ @ Two Vertices,
|
||||
* Two Edges (Parallel Edges) \-/ @ / \ Three Vertices, Three Edges (Cycle)
|
||||
* @---@ @--@--@ Three Vertices, Two Edges (No Cycle) @ / \ @ @ 5 Vertices, 4
|
||||
* Edges (Tree) / \ @ @ @-@ @-@ 4 Vertices, 2 Edges (Disconnected)
|
||||
*/
|
||||
|
||||
import java.util.Set;
|
||||
import java.util.Map;
|
||||
import java.util.HashSet;
|
||||
import java.util.HashMap;
|
||||
import java.util.Iterator;
|
||||
|
||||
import junit.framework.*;
|
||||
|
||||
/**
|
||||
* Description of the Class
|
||||
*/
|
||||
public class UndirGraphTest extends GraphTest
|
||||
{
|
||||
/**
|
||||
* Constructor for the UndirGraphTest object
|
||||
*
|
||||
* @param name
|
||||
*/
|
||||
public UndirGraphTest(String name)
|
||||
{
|
||||
super(name);
|
||||
}
|
||||
|
||||
/**
|
||||
* Test the NULL Graph.
|
||||
*/
|
||||
public void testNullGraph()
|
||||
throws Throwable
|
||||
{
|
||||
verifyGraph(makeNullGraph(), 0, 0);
|
||||
}
|
||||
|
||||
|
||||
/**
|
||||
* Test the Single Vertex.
|
||||
*/
|
||||
public void testSingleVertex()
|
||||
throws Throwable
|
||||
{
|
||||
verifyGraph(makeSingleVertex(), 1, 0);
|
||||
}
|
||||
|
||||
/**
|
||||
* Tests Double Vertex graph.
|
||||
*/
|
||||
public void testDoubleVertex()
|
||||
throws Throwable
|
||||
{
|
||||
verifyGraph(makeDoubleVertex(), 2, 0);
|
||||
}
|
||||
|
||||
/**
|
||||
* Test Single Edge Graph.
|
||||
*/
|
||||
public void testSingleEdge()
|
||||
throws Throwable
|
||||
{
|
||||
Graph IUT = makeSingleEdge();
|
||||
|
||||
verifyGraph(IUT, 2, 1);
|
||||
|
||||
// Verify Edge from Vertex Count
|
||||
verifyVertexEdgeCount(IUT, V1, 1);
|
||||
verifyVertexEdgeCount(IUT, V2, 1);
|
||||
|
||||
Set expectV1 = new HashSet();
|
||||
expectV1.add(V2);
|
||||
|
||||
verifyAdjVertices(IUT, V1, expectV1);
|
||||
|
||||
Set expectV2 = new HashSet();
|
||||
expectV2.add(V1);
|
||||
|
||||
verifyAdjVertices(IUT, V2, expectV2);
|
||||
}
|
||||
|
||||
/**
|
||||
* Test Parallel Edges, make sure the representation is right.
|
||||
*/
|
||||
public void testParallelEdges()
|
||||
throws Throwable
|
||||
{
|
||||
Graph IUT = makeParallelEdges();
|
||||
|
||||
verifyGraph(IUT, 2, 2);
|
||||
|
||||
// Verify Edge from Vertex Count
|
||||
verifyVertexEdgeCount(IUT, V1, 2);
|
||||
verifyVertexEdgeCount(IUT, V2, 2);
|
||||
|
||||
// Verify Adjacent Vertex
|
||||
Set expectV1 = new HashSet();
|
||||
Set expectV2 = new HashSet();
|
||||
|
||||
expectV1.add(V2);
|
||||
expectV2.add(V1);
|
||||
|
||||
verifyAdjVertices(IUT, V1, expectV1);
|
||||
verifyAdjVertices(IUT, V2, expectV2);
|
||||
|
||||
}
|
||||
|
||||
/**
|
||||
* Test the Cycle Graph.
|
||||
*/
|
||||
public void testCycle()
|
||||
throws Throwable
|
||||
{
|
||||
Graph IUT = makeCycle();
|
||||
|
||||
verifyGraph(IUT, 3, 3);
|
||||
|
||||
// Verify Edge from Vertex Count
|
||||
verifyVertexEdgeCount(IUT, V1, 2);
|
||||
verifyVertexEdgeCount(IUT, V2, 2);
|
||||
verifyVertexEdgeCount(IUT, V3, 2);
|
||||
|
||||
// Verify Adjacent Vertex
|
||||
Set expectV1 = new HashSet();
|
||||
Set expectV2 = new HashSet();
|
||||
Set expectV3 = new HashSet();
|
||||
|
||||
expectV1.add(V2);
|
||||
expectV1.add(V3);
|
||||
expectV2.add(V1);
|
||||
expectV2.add(V3);
|
||||
expectV3.add(V1);
|
||||
expectV3.add(V2);
|
||||
|
||||
verifyAdjVertices(IUT, V1, expectV1);
|
||||
verifyAdjVertices(IUT, V2, expectV2);
|
||||
verifyAdjVertices(IUT, V3, expectV3);
|
||||
}
|
||||
|
||||
/**
|
||||
* Test the No Cycle Graph.
|
||||
*/
|
||||
public void testNoCycle()
|
||||
throws Throwable
|
||||
{
|
||||
Graph IUT = makeNoCycle();
|
||||
|
||||
verifyGraph(IUT, 3, 2);
|
||||
|
||||
// Verify Edge from Vertex Count
|
||||
verifyVertexEdgeCount(IUT, V1, 1);
|
||||
verifyVertexEdgeCount(IUT, V2, 2);
|
||||
verifyVertexEdgeCount(IUT, V3, 1);
|
||||
|
||||
// Verify Adjacent Vertex
|
||||
Set expectV1 = new HashSet();
|
||||
Set expectV2 = new HashSet();
|
||||
Set expectV3 = new HashSet();
|
||||
|
||||
expectV1.add(V2);
|
||||
expectV2.add(V1);
|
||||
expectV2.add(V3);
|
||||
expectV3.add(V2);
|
||||
|
||||
verifyAdjVertices(IUT, V1, expectV1);
|
||||
verifyAdjVertices(IUT, V2, expectV2);
|
||||
verifyAdjVertices(IUT, V3, expectV3);
|
||||
}
|
||||
|
||||
/**
|
||||
* Test the Tree Graph.
|
||||
*/
|
||||
public void testTree()
|
||||
throws Throwable
|
||||
{
|
||||
Graph IUT = makeTree();
|
||||
|
||||
verifyGraph(IUT, 5, 4);
|
||||
|
||||
// Verify Edge from Vertex Count
|
||||
verifyVertexEdgeCount(IUT, V1, 2);
|
||||
verifyVertexEdgeCount(IUT, V2, 1);
|
||||
verifyVertexEdgeCount(IUT, V3, 3);
|
||||
verifyVertexEdgeCount(IUT, V4, 1);
|
||||
verifyVertexEdgeCount(IUT, V5, 1);
|
||||
|
||||
// Verify Adjacent Vertex
|
||||
Set expectV1 = new HashSet();
|
||||
Set expectV2 = new HashSet();
|
||||
Set expectV3 = new HashSet();
|
||||
Set expectV4 = new HashSet();
|
||||
Set expectV5 = new HashSet();
|
||||
|
||||
expectV1.add(V2);
|
||||
expectV1.add(V3);
|
||||
expectV2.add(V1);
|
||||
expectV3.add(V1);
|
||||
expectV3.add(V4);
|
||||
expectV3.add(V5);
|
||||
expectV4.add(V3);
|
||||
expectV5.add(V3);
|
||||
|
||||
verifyAdjVertices(IUT, V1, expectV1);
|
||||
verifyAdjVertices(IUT, V2, expectV2);
|
||||
verifyAdjVertices(IUT, V3, expectV3);
|
||||
verifyAdjVertices(IUT, V4, expectV4);
|
||||
verifyAdjVertices(IUT, V5, expectV5);
|
||||
}
|
||||
|
||||
/**
|
||||
* Test the Disconnected Graph.
|
||||
*/
|
||||
public void testDisconnected()
|
||||
throws Throwable
|
||||
{
|
||||
Graph IUT = makeDisconnected();
|
||||
|
||||
verifyGraph(IUT, 4, 2);
|
||||
|
||||
// Verify Edge from Vertex Count
|
||||
verifyVertexEdgeCount(IUT, V1, 1);
|
||||
verifyVertexEdgeCount(IUT, V2, 1);
|
||||
verifyVertexEdgeCount(IUT, V3, 1);
|
||||
verifyVertexEdgeCount(IUT, V4, 1);
|
||||
|
||||
// Verify Adjacent Vertex
|
||||
Set expectV1 = new HashSet();
|
||||
Set expectV2 = new HashSet();
|
||||
Set expectV3 = new HashSet();
|
||||
Set expectV4 = new HashSet();
|
||||
|
||||
expectV1.add(V2);
|
||||
expectV2.add(V1);
|
||||
expectV3.add(V4);
|
||||
expectV4.add(V3);
|
||||
|
||||
verifyAdjVertices(IUT, V1, expectV1);
|
||||
verifyAdjVertices(IUT, V2, expectV2);
|
||||
verifyAdjVertices(IUT, V3, expectV3);
|
||||
verifyAdjVertices(IUT, V4, expectV4);
|
||||
}
|
||||
|
||||
|
||||
/**
|
||||
* Description of the Method
|
||||
*/
|
||||
public void verifyVertexEdgeCount(Graph IUT,
|
||||
Vertex v,
|
||||
int numEdge)
|
||||
throws Throwable
|
||||
{
|
||||
assertEquals(v.toString() + " has wrong number of adjacent edges.",
|
||||
IUT.getEdges(v).size(), numEdge);
|
||||
}
|
||||
|
||||
/**
|
||||
* Gets the adjVertices attribute of the UndirGraphTest object
|
||||
*/
|
||||
private Set getAdjVertices(Graph IUT,
|
||||
Vertex v)
|
||||
{
|
||||
Set RC = new HashSet();
|
||||
Iterator edges = IUT.getEdges(v).iterator();
|
||||
|
||||
while (edges.hasNext())
|
||||
{
|
||||
Edge e = (Edge) edges.next();
|
||||
|
||||
Set verts = IUT.getVertices(e);
|
||||
verts.remove(v);
|
||||
RC.addAll(verts);
|
||||
}
|
||||
|
||||
return RC;
|
||||
}
|
||||
|
||||
/**
|
||||
* Description of the Method
|
||||
*/
|
||||
public void verifyAdjVertices(Graph IUT,
|
||||
Vertex v,
|
||||
Set expected)
|
||||
throws Throwable
|
||||
{
|
||||
Set adjacent = getAdjVertices(IUT, v);
|
||||
Iterator adjV = adjacent.iterator();
|
||||
|
||||
while (adjV.hasNext())
|
||||
{
|
||||
Vertex curr = (Vertex) adjV.next();
|
||||
|
||||
assertTrue(curr.toString() + " is not supposed to be " +
|
||||
"next to " + v.toString(),
|
||||
expected.contains(curr));
|
||||
}
|
||||
|
||||
Iterator expect = expected.iterator();
|
||||
|
||||
while (expect.hasNext())
|
||||
{
|
||||
Vertex curr = (Vertex) expect.next();
|
||||
|
||||
assertTrue(curr.toString() + " is supposed to be next to " +
|
||||
v.toString(),
|
||||
adjacent.contains(curr));
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* Description of the Method
|
||||
*/
|
||||
public void verifyGraph(Graph g, int numVertex, int numEdge)
|
||||
throws Throwable
|
||||
{
|
||||
assertEquals("Incorrect Number of Vertices.",
|
||||
g.getVertices().size(), numVertex);
|
||||
assertEquals("Incorrect Number of Edges.",
|
||||
g.getEdges().size(), numEdge);
|
||||
}
|
||||
}
|
||||
package org.apache.commons.graph;
|
||||
|
||||
/* ====================================================================
|
||||
* The Apache Software License, Version 1.1
|
||||
*
|
||||
* Copyright (c) 2001 The Apache Software Foundation. All rights
|
||||
* reserved.
|
||||
*
|
||||
* Redistribution and use in source and binary forms, with or without
|
||||
* modification, are permitted provided that the following conditions
|
||||
* are met:
|
||||
*
|
||||
* 1. Redistributions of source code must retain the above copyright
|
||||
* notice, this list of conditions and the following disclaimer.
|
||||
*
|
||||
* 2. Redistributions in binary form must reproduce the above copyright
|
||||
* notice, this list of conditions and the following disclaimer in
|
||||
* the documentation and/or other materials provided with the
|
||||
* distribution.
|
||||
*
|
||||
* 3. The end-user documentation included with the redistribution,
|
||||
* if any, must include the following acknowledgment:
|
||||
* "This product includes software developed by the
|
||||
* Apache Software Foundation (http://www.apache.org/)."
|
||||
* Alternately, this acknowledgment may appear in the software itself,
|
||||
* if and wherever such third-party acknowledgments normally appear.
|
||||
*
|
||||
* 4. The names "Apache" and "Apache Software Foundation" and
|
||||
* "Commons" must not be used to endorse or promote products
|
||||
* derived from this software without prior written permission. For
|
||||
* written permission, please contact apache@apache.org.
|
||||
*
|
||||
* 5. Products derived from this software may not be called "Apache",
|
||||
* "Commons", nor may "Apache" appear in their name, without
|
||||
* prior written permission of the Apache Software Foundation.
|
||||
*
|
||||
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED
|
||||
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
||||
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
||||
* DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR
|
||||
* ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
||||
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
|
||||
* USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
|
||||
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
||||
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
|
||||
* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
||||
* SUCH DAMAGE.
|
||||
* ====================================================================
|
||||
*
|
||||
* This software consists of voluntary contributions made by many
|
||||
* individuals on behalf of the Apache Software Foundation. For more
|
||||
* information on the Apache Software Foundation, please see
|
||||
* <http://www.apache.org/>.
|
||||
*/
|
||||
/**
|
||||
* GraphTest This test will ensure that we can indeed represent a graph. We will
|
||||
* implement the following graphs. () No Vertex, No Edges @ One Vertex, No Edges
|
||||
* @ @ Two Vertices, No Edges @-@ Two Vertices, One edge /-\ @ @ Two Vertices,
|
||||
* Two Edges (Parallel Edges) \-/ @ / \ Three Vertices, Three Edges (Cycle)
|
||||
* @---@ @--@--@ Three Vertices, Two Edges (No Cycle) @ / \ @ @ 5 Vertices, 4
|
||||
* Edges (Tree) / \ @ @ @-@ @-@ 4 Vertices, 2 Edges (Disconnected)
|
||||
*/
|
||||
|
||||
import java.util.Set;
|
||||
import java.util.Map;
|
||||
import java.util.HashSet;
|
||||
import java.util.HashMap;
|
||||
import java.util.Iterator;
|
||||
|
||||
import junit.framework.*;
|
||||
|
||||
/**
|
||||
* Description of the Class
|
||||
*/
|
||||
public class UndirGraphTest extends GraphTest
|
||||
{
|
||||
/**
|
||||
* Constructor for the UndirGraphTest object
|
||||
*
|
||||
* @param name
|
||||
*/
|
||||
public UndirGraphTest(String name)
|
||||
{
|
||||
super(name);
|
||||
}
|
||||
|
||||
/**
|
||||
* Test the NULL Graph.
|
||||
*/
|
||||
public void testNullGraph()
|
||||
throws Throwable
|
||||
{
|
||||
verifyGraph(makeNullGraph(), 0, 0);
|
||||
}
|
||||
|
||||
|
||||
/**
|
||||
* Test the Single Vertex.
|
||||
*/
|
||||
public void testSingleVertex()
|
||||
throws Throwable
|
||||
{
|
||||
verifyGraph(makeSingleVertex(), 1, 0);
|
||||
}
|
||||
|
||||
/**
|
||||
* Tests Double Vertex graph.
|
||||
*/
|
||||
public void testDoubleVertex()
|
||||
throws Throwable
|
||||
{
|
||||
verifyGraph(makeDoubleVertex(), 2, 0);
|
||||
}
|
||||
|
||||
/**
|
||||
* Test Single Edge Graph.
|
||||
*/
|
||||
public void testSingleEdge()
|
||||
throws Throwable
|
||||
{
|
||||
Graph IUT = makeSingleEdge();
|
||||
|
||||
verifyGraph(IUT, 2, 1);
|
||||
|
||||
// Verify Edge from Vertex Count
|
||||
verifyVertexEdgeCount(IUT, V1, 1);
|
||||
verifyVertexEdgeCount(IUT, V2, 1);
|
||||
|
||||
Set expectV1 = new HashSet();
|
||||
expectV1.add(V2);
|
||||
|
||||
verifyAdjVertices(IUT, V1, expectV1);
|
||||
|
||||
Set expectV2 = new HashSet();
|
||||
expectV2.add(V1);
|
||||
|
||||
verifyAdjVertices(IUT, V2, expectV2);
|
||||
}
|
||||
|
||||
/**
|
||||
* Test Parallel Edges, make sure the representation is right.
|
||||
*/
|
||||
public void testParallelEdges()
|
||||
throws Throwable
|
||||
{
|
||||
Graph IUT = makeParallelEdges();
|
||||
|
||||
verifyGraph(IUT, 2, 2);
|
||||
|
||||
// Verify Edge from Vertex Count
|
||||
verifyVertexEdgeCount(IUT, V1, 2);
|
||||
verifyVertexEdgeCount(IUT, V2, 2);
|
||||
|
||||
// Verify Adjacent Vertex
|
||||
Set expectV1 = new HashSet();
|
||||
Set expectV2 = new HashSet();
|
||||
|
||||
expectV1.add(V2);
|
||||
expectV2.add(V1);
|
||||
|
||||
verifyAdjVertices(IUT, V1, expectV1);
|
||||
verifyAdjVertices(IUT, V2, expectV2);
|
||||
|
||||
}
|
||||
|
||||
/**
|
||||
* Test the Cycle Graph.
|
||||
*/
|
||||
public void testCycle()
|
||||
throws Throwable
|
||||
{
|
||||
Graph IUT = makeCycle();
|
||||
|
||||
verifyGraph(IUT, 3, 3);
|
||||
|
||||
// Verify Edge from Vertex Count
|
||||
verifyVertexEdgeCount(IUT, V1, 2);
|
||||
verifyVertexEdgeCount(IUT, V2, 2);
|
||||
verifyVertexEdgeCount(IUT, V3, 2);
|
||||
|
||||
// Verify Adjacent Vertex
|
||||
Set expectV1 = new HashSet();
|
||||
Set expectV2 = new HashSet();
|
||||
Set expectV3 = new HashSet();
|
||||
|
||||
expectV1.add(V2);
|
||||
expectV1.add(V3);
|
||||
expectV2.add(V1);
|
||||
expectV2.add(V3);
|
||||
expectV3.add(V1);
|
||||
expectV3.add(V2);
|
||||
|
||||
verifyAdjVertices(IUT, V1, expectV1);
|
||||
verifyAdjVertices(IUT, V2, expectV2);
|
||||
verifyAdjVertices(IUT, V3, expectV3);
|
||||
}
|
||||
|
||||
/**
|
||||
* Test the No Cycle Graph.
|
||||
*/
|
||||
public void testNoCycle()
|
||||
throws Throwable
|
||||
{
|
||||
Graph IUT = makeNoCycle();
|
||||
|
||||
verifyGraph(IUT, 3, 2);
|
||||
|
||||
// Verify Edge from Vertex Count
|
||||
verifyVertexEdgeCount(IUT, V1, 1);
|
||||
verifyVertexEdgeCount(IUT, V2, 2);
|
||||
verifyVertexEdgeCount(IUT, V3, 1);
|
||||
|
||||
// Verify Adjacent Vertex
|
||||
Set expectV1 = new HashSet();
|
||||
Set expectV2 = new HashSet();
|
||||
Set expectV3 = new HashSet();
|
||||
|
||||
expectV1.add(V2);
|
||||
expectV2.add(V1);
|
||||
expectV2.add(V3);
|
||||
expectV3.add(V2);
|
||||
|
||||
verifyAdjVertices(IUT, V1, expectV1);
|
||||
verifyAdjVertices(IUT, V2, expectV2);
|
||||
verifyAdjVertices(IUT, V3, expectV3);
|
||||
}
|
||||
|
||||
/**
|
||||
* Test the Tree Graph.
|
||||
*/
|
||||
public void testTree()
|
||||
throws Throwable
|
||||
{
|
||||
Graph IUT = makeTree();
|
||||
|
||||
verifyGraph(IUT, 5, 4);
|
||||
|
||||
// Verify Edge from Vertex Count
|
||||
verifyVertexEdgeCount(IUT, V1, 2);
|
||||
verifyVertexEdgeCount(IUT, V2, 1);
|
||||
verifyVertexEdgeCount(IUT, V3, 3);
|
||||
verifyVertexEdgeCount(IUT, V4, 1);
|
||||
verifyVertexEdgeCount(IUT, V5, 1);
|
||||
|
||||
// Verify Adjacent Vertex
|
||||
Set expectV1 = new HashSet();
|
||||
Set expectV2 = new HashSet();
|
||||
Set expectV3 = new HashSet();
|
||||
Set expectV4 = new HashSet();
|
||||
Set expectV5 = new HashSet();
|
||||
|
||||
expectV1.add(V2);
|
||||
expectV1.add(V3);
|
||||
expectV2.add(V1);
|
||||
expectV3.add(V1);
|
||||
expectV3.add(V4);
|
||||
expectV3.add(V5);
|
||||
expectV4.add(V3);
|
||||
expectV5.add(V3);
|
||||
|
||||
verifyAdjVertices(IUT, V1, expectV1);
|
||||
verifyAdjVertices(IUT, V2, expectV2);
|
||||
verifyAdjVertices(IUT, V3, expectV3);
|
||||
verifyAdjVertices(IUT, V4, expectV4);
|
||||
verifyAdjVertices(IUT, V5, expectV5);
|
||||
}
|
||||
|
||||
/**
|
||||
* Test the Disconnected Graph.
|
||||
*/
|
||||
public void testDisconnected()
|
||||
throws Throwable
|
||||
{
|
||||
Graph IUT = makeDisconnected();
|
||||
|
||||
verifyGraph(IUT, 4, 2);
|
||||
|
||||
// Verify Edge from Vertex Count
|
||||
verifyVertexEdgeCount(IUT, V1, 1);
|
||||
verifyVertexEdgeCount(IUT, V2, 1);
|
||||
verifyVertexEdgeCount(IUT, V3, 1);
|
||||
verifyVertexEdgeCount(IUT, V4, 1);
|
||||
|
||||
// Verify Adjacent Vertex
|
||||
Set expectV1 = new HashSet();
|
||||
Set expectV2 = new HashSet();
|
||||
Set expectV3 = new HashSet();
|
||||
Set expectV4 = new HashSet();
|
||||
|
||||
expectV1.add(V2);
|
||||
expectV2.add(V1);
|
||||
expectV3.add(V4);
|
||||
expectV4.add(V3);
|
||||
|
||||
verifyAdjVertices(IUT, V1, expectV1);
|
||||
verifyAdjVertices(IUT, V2, expectV2);
|
||||
verifyAdjVertices(IUT, V3, expectV3);
|
||||
verifyAdjVertices(IUT, V4, expectV4);
|
||||
}
|
||||
|
||||
|
||||
/**
|
||||
* Description of the Method
|
||||
*/
|
||||
public void verifyVertexEdgeCount(Graph IUT,
|
||||
Vertex v,
|
||||
int numEdge)
|
||||
throws Throwable
|
||||
{
|
||||
assertEquals(v.toString() + " has wrong number of adjacent edges.",
|
||||
IUT.getEdges(v).size(), numEdge);
|
||||
}
|
||||
|
||||
/**
|
||||
* Gets the adjVertices attribute of the UndirGraphTest object
|
||||
*/
|
||||
private Set getAdjVertices(Graph IUT,
|
||||
Vertex v)
|
||||
{
|
||||
Set RC = new HashSet();
|
||||
Iterator edges = IUT.getEdges(v).iterator();
|
||||
|
||||
while (edges.hasNext())
|
||||
{
|
||||
Edge e = (Edge) edges.next();
|
||||
|
||||
Set verts = IUT.getVertices(e);
|
||||
verts.remove(v);
|
||||
RC.addAll(verts);
|
||||
}
|
||||
|
||||
return RC;
|
||||
}
|
||||
|
||||
/**
|
||||
* Description of the Method
|
||||
*/
|
||||
public void verifyAdjVertices(Graph IUT,
|
||||
Vertex v,
|
||||
Set expected)
|
||||
throws Throwable
|
||||
{
|
||||
Set adjacent = getAdjVertices(IUT, v);
|
||||
Iterator adjV = adjacent.iterator();
|
||||
|
||||
while (adjV.hasNext())
|
||||
{
|
||||
Vertex curr = (Vertex) adjV.next();
|
||||
|
||||
assertTrue(curr.toString() + " is not supposed to be " +
|
||||
"next to " + v.toString(),
|
||||
expected.contains(curr));
|
||||
}
|
||||
|
||||
Iterator expect = expected.iterator();
|
||||
|
||||
while (expect.hasNext())
|
||||
{
|
||||
Vertex curr = (Vertex) expect.next();
|
||||
|
||||
assertTrue(curr.toString() + " is supposed to be next to " +
|
||||
v.toString(),
|
||||
adjacent.contains(curr));
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* Description of the Method
|
||||
*/
|
||||
public void verifyGraph(Graph g, int numVertex, int numEdge)
|
||||
throws Throwable
|
||||
{
|
||||
assertEquals("Incorrect Number of Vertices.",
|
||||
g.getVertices().size(), numVertex);
|
||||
assertEquals("Incorrect Number of Edges.",
|
||||
g.getEdges().size(), numEdge);
|
||||
}
|
||||
}
|
||||
File diff suppressed because it is too large.
Load diff
@@ -1,461 +1,461 @@
|
||||
package org.apache.commons.graph.contract;
|
||||
|
||||
/* ====================================================================
|
||||
* The Apache Software License, Version 1.1
|
||||
*
|
||||
* Copyright (c) 2001 The Apache Software Foundation. All rights
|
||||
* reserved.
|
||||
*
|
||||
* Redistribution and use in source and binary forms, with or without
|
||||
* modification, are permitted provided that the following conditions
|
||||
* are met:
|
||||
*
|
||||
* 1. Redistributions of source code must retain the above copyright
|
||||
* notice, this list of conditions and the following disclaimer.
|
||||
*
|
||||
* 2. Redistributions in binary form must reproduce the above copyright
|
||||
* notice, this list of conditions and the following disclaimer in
|
||||
* the documentation and/or other materials provided with the
|
||||
* distribution.
|
||||
*
|
||||
* 3. The end-user documentation included with the redistribution,
|
||||
* if any, must include the following acknowledgment:
|
||||
* "This product includes software developed by the
|
||||
* Apache Software Foundation (http://www.apache.org/)."
|
||||
* Alternately, this acknowledgment may appear in the software itself,
|
||||
* if and wherever such third-party acknowledgments normally appear.
|
||||
*
|
||||
* 4. The names "Apache" and "Apache Software Foundation" and
|
||||
* "Commons" must not be used to endorse or promote products
|
||||
* derived from this software without prior written permission. For
|
||||
* written permission, please contact apache@apache.org.
|
||||
*
|
||||
* 5. Products derived from this software may not be called "Apache",
|
||||
* "Commons", nor may "Apache" appear in their name, without
|
||||
* prior written permission of the Apache Software Foundation.
|
||||
*
|
||||
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED
|
||||
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
||||
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
||||
* DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR
|
||||
* ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
||||
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
|
||||
* USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
|
||||
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
||||
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
|
||||
* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
||||
* SUCH DAMAGE.
|
||||
* ====================================================================
|
||||
*
|
||||
* This software consists of voluntary contributions made by many
|
||||
* individuals on behalf of the Apache Software Foundation. For more
|
||||
* information on the Apache Software Foundation, please see
|
||||
* <http://www.apache.org/>.
|
||||
*/
|
||||
import org.apache.commons.graph.*;
|
||||
import org.apache.commons.graph.exception.*;
|
||||
|
||||
/**
|
||||
* Description of the Class
|
||||
*/
|
||||
public class AcyclicContractTest
|
||||
extends GraphTest
|
||||
{
|
||||
/**
|
||||
* Constructor for the AcyclicContractTest object
|
||||
*
|
||||
* @param name
|
||||
*/
|
||||
public AcyclicContractTest(String name)
|
||||
{
|
||||
super(name);
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testDirNullGraph()
|
||||
throws Throwable
|
||||
{
|
||||
AcyclicContract IUT =
|
||||
new AcyclicContract();
|
||||
IUT.setImpl(makeDirNullGraph());
|
||||
|
||||
IUT.verify();
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testDirSingleVertex()
|
||||
throws Throwable
|
||||
{
|
||||
AcyclicContract IUT =
|
||||
new AcyclicContract();
|
||||
IUT.setImpl(makeDirSingleVertex());
|
||||
IUT.verify();
|
||||
|
||||
try
|
||||
{
|
||||
IUT.addEdge(V1_V1, V1, V1);
|
||||
fail("No GraphException thrown when Self-Cycle introduced.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testSelfLoop()
|
||||
throws Throwable
|
||||
{
|
||||
AcyclicContract IUT =
|
||||
new AcyclicContract();
|
||||
IUT.setImpl(makeSelfLoop());
|
||||
|
||||
try
|
||||
{
|
||||
IUT.verify();
|
||||
fail("No CycleException thrown on Verification.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testDirDoubleVertex()
|
||||
throws Throwable
|
||||
{
|
||||
AcyclicContract IUT =
|
||||
new AcyclicContract();
|
||||
IUT.setImpl(makeDirDoubleVertex());
|
||||
IUT.verify();
|
||||
|
||||
try
|
||||
{
|
||||
IUT.addEdge(V1_V1, V1, V1);
|
||||
fail("No GraphException thrown when Self-Cycle introduced.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
|
||||
try
|
||||
{
|
||||
IUT.addEdge(V1_V2, V1, V2);
|
||||
}
|
||||
catch (GraphException ex)
|
||||
{
|
||||
fail("Contract prevented adding of valid edge. V1->V2");
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testDirectedEdge()
|
||||
throws Throwable
|
||||
{
|
||||
AcyclicContract IUT =
|
||||
new AcyclicContract();
|
||||
IUT.setImpl(makeDirectedEdge());
|
||||
IUT.verify();
|
||||
|
||||
try
|
||||
{
|
||||
IUT.addEdge(V1_V1, V1, V1);
|
||||
fail("No GraphException thrown when Self-Cycle introduced.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
|
||||
try
|
||||
{
|
||||
IUT.addEdge(V1_V2_, V1, V2);
|
||||
}
|
||||
catch (GraphException ex)
|
||||
{
|
||||
fail("Contract prevented adding of valid edge. V1->V2'");
|
||||
}
|
||||
|
||||
try
|
||||
{
|
||||
IUT.addEdge(V2_V1, V2, V1);
|
||||
fail("Contract allowed cycle to be introduced.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testDirParallelEdges()
|
||||
throws Throwable
|
||||
{
|
||||
AcyclicContract IUT =
|
||||
new AcyclicContract();
|
||||
IUT.setImpl(makeDirParallelEdges());
|
||||
IUT.verify();
|
||||
|
||||
try
|
||||
{
|
||||
IUT.addEdge(V1_V1, V1, V1);
|
||||
fail("No GraphException thrown when Self-Cycle introduced.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
|
||||
try
|
||||
{
|
||||
IUT.addEdge(V1_V2__, V1, V2);
|
||||
}
|
||||
catch (GraphException ex)
|
||||
{
|
||||
fail("Contract prevented adding of valid edge. V1->V2'");
|
||||
}
|
||||
|
||||
try
|
||||
{
|
||||
IUT.addEdge(V2_V1, V2, V1);
|
||||
fail("Contract allowed cycle to be introduced.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
}
|
||||
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testTwoCycle()
|
||||
throws Throwable
|
||||
{
|
||||
AcyclicContract IUT =
|
||||
new AcyclicContract();
|
||||
IUT.setImpl(makeTwoCycle());
|
||||
|
||||
try
|
||||
{
|
||||
IUT.verify();
|
||||
fail("No CycleException thrown on Verification.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
}
|
||||
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testDirectedCycle()
|
||||
throws Throwable
|
||||
{
|
||||
AcyclicContract IUT =
|
||||
new AcyclicContract();
|
||||
IUT.setImpl(makeDirectedCycle());
|
||||
|
||||
try
|
||||
{
|
||||
IUT.verify();
|
||||
fail("No CycleException thrown on Verification.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testPipe()
|
||||
throws Throwable
|
||||
{
|
||||
AcyclicContract IUT =
|
||||
new AcyclicContract();
|
||||
IUT.setImpl(makePipe());
|
||||
IUT.verify();
|
||||
|
||||
try
|
||||
{
|
||||
IUT.addEdge(V1_V1, V1, V1);
|
||||
fail("No GraphException thrown when Self-Cycle introduced.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
|
||||
try
|
||||
{
|
||||
IUT.addEdge(V1_V2_, V1, V2);
|
||||
}
|
||||
catch (GraphException ex)
|
||||
{
|
||||
fail("Contract prevented adding of valid edge. V1->V2'");
|
||||
}
|
||||
|
||||
try
|
||||
{
|
||||
IUT.addEdge(V3_V1, V3, V1);
|
||||
fail("Contract allowed cycle to be introduced.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testDiamond()
|
||||
throws Throwable
|
||||
{
|
||||
AcyclicContract IUT =
|
||||
new AcyclicContract();
|
||||
IUT.setImpl(makeDiamond());
|
||||
IUT.verify();
|
||||
|
||||
try
|
||||
{
|
||||
IUT.addEdge(V1_V1, V1, V1);
|
||||
fail("No GraphException thrown when Self-Cycle introduced.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
|
||||
try
|
||||
{
|
||||
IUT.addEdge(V2_V3, V2, V3);
|
||||
}
|
||||
catch (GraphException ex)
|
||||
{
|
||||
fail("Contract prevented adding of valid edge. V2->V3");
|
||||
}
|
||||
|
||||
try
|
||||
{
|
||||
IUT.addEdge(V4_V1, V4, V1);
|
||||
fail("Contract allowed cycle to be introduced.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testPipelessCycle()
|
||||
throws Throwable
|
||||
{
|
||||
AcyclicContract IUT =
|
||||
new AcyclicContract();
|
||||
IUT.setImpl(makePipelessCycle());
|
||||
IUT.verify();
|
||||
|
||||
try
|
||||
{
|
||||
IUT.addEdge(V1_V1, V1, V1);
|
||||
fail("No GraphException thrown when Self-Cycle introduced.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
|
||||
try
|
||||
{
|
||||
IUT.addEdge(V2_V3, V2, V3);
|
||||
}
|
||||
catch (GraphException ex)
|
||||
{
|
||||
fail("Contract prevented adding of valid edge. V2->V3");
|
||||
}
|
||||
|
||||
try
|
||||
{
|
||||
IUT.addEdge(V3_V4, V3, V4);
|
||||
fail("Contract allowed cycle to be introduced.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
|
||||
}
|
||||
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testParentTree()
|
||||
throws Throwable
|
||||
{
|
||||
System.err.println("---- PARENT TREE ----");
|
||||
AcyclicContract IUT =
|
||||
new AcyclicContract();
|
||||
IUT.setImpl(makeParentTree());
|
||||
IUT.verify();
|
||||
|
||||
try
|
||||
{
|
||||
IUT.addEdge(V1_V1, V1, V1);
|
||||
fail("No GraphException thrown when Self-Cycle introduced.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
|
||||
try
|
||||
{
|
||||
IUT.addEdge(V2_V3, V2, V3);
|
||||
}
|
||||
catch (GraphException ex)
|
||||
{
|
||||
fail("Contract prevented adding of valid edge. V2->V3");
|
||||
}
|
||||
|
||||
try
|
||||
{
|
||||
IUT.addEdge(V1_V5, V1, V5);
|
||||
fail("Contract allowed cycle to be introduced.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
}
|
||||
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testChildTree()
|
||||
throws Throwable
|
||||
{
|
||||
AcyclicContract IUT =
|
||||
new AcyclicContract();
|
||||
IUT.setImpl(makeChildTree());
|
||||
IUT.verify();
|
||||
|
||||
try
|
||||
{
|
||||
IUT.addEdge(V1_V1, V1, V1);
|
||||
fail("No GraphException thrown when Self-Cycle introduced.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
|
||||
try
|
||||
{
|
||||
IUT.addEdge(V2_V3, V2, V3);
|
||||
}
|
||||
catch (GraphException ex)
|
||||
{
|
||||
fail("Contract prevented adding of valid edge. V2->V3");
|
||||
}
|
||||
|
||||
try
|
||||
{
|
||||
IUT.addEdge(V5_V1, V5, V1);
|
||||
fail("Contract allowed cycle to be introduced.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
|
||||
}
|
||||
}
|
||||
package org.apache.commons.graph.contract;
|
||||
|
||||
/* ====================================================================
|
||||
* The Apache Software License, Version 1.1
|
||||
*
|
||||
* Copyright (c) 2001 The Apache Software Foundation. All rights
|
||||
* reserved.
|
||||
*
|
||||
* Redistribution and use in source and binary forms, with or without
|
||||
* modification, are permitted provided that the following conditions
|
||||
* are met:
|
||||
*
|
||||
* 1. Redistributions of source code must retain the above copyright
|
||||
* notice, this list of conditions and the following disclaimer.
|
||||
*
|
||||
* 2. Redistributions in binary form must reproduce the above copyright
|
||||
* notice, this list of conditions and the following disclaimer in
|
||||
* the documentation and/or other materials provided with the
|
||||
* distribution.
|
||||
*
|
||||
* 3. The end-user documentation included with the redistribution,
|
||||
* if any, must include the following acknowledgment:
|
||||
* "This product includes software developed by the
|
||||
* Apache Software Foundation (http://www.apache.org/)."
|
||||
* Alternately, this acknowledgment may appear in the software itself,
|
||||
* if and wherever such third-party acknowledgments normally appear.
|
||||
*
|
||||
* 4. The names "Apache" and "Apache Software Foundation" and
|
||||
* "Commons" must not be used to endorse or promote products
|
||||
* derived from this software without prior written permission. For
|
||||
* written permission, please contact apache@apache.org.
|
||||
*
|
||||
* 5. Products derived from this software may not be called "Apache",
|
||||
* "Commons", nor may "Apache" appear in their name, without
|
||||
* prior written permission of the Apache Software Foundation.
|
||||
*
|
||||
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED
|
||||
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
||||
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
||||
* DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR
|
||||
* ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
||||
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
|
||||
* USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
|
||||
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
||||
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
|
||||
* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
||||
* SUCH DAMAGE.
|
||||
* ====================================================================
|
||||
*
|
||||
* This software consists of voluntary contributions made by many
|
||||
* individuals on behalf of the Apache Software Foundation. For more
|
||||
* information on the Apache Software Foundation, please see
|
||||
* <http://www.apache.org/>.
|
||||
*/
|
||||
import org.apache.commons.graph.*;
|
||||
import org.apache.commons.graph.exception.*;
|
||||
|
||||
/**
|
||||
* Description of the Class
|
||||
*/
|
||||
public class AcyclicContractTest
|
||||
extends GraphTest
|
||||
{
|
||||
/**
|
||||
* Constructor for the AcyclicContractTest object
|
||||
*
|
||||
* @param name
|
||||
*/
|
||||
public AcyclicContractTest(String name)
|
||||
{
|
||||
super(name);
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testDirNullGraph()
|
||||
throws Throwable
|
||||
{
|
||||
AcyclicContract IUT =
|
||||
new AcyclicContract();
|
||||
IUT.setImpl(makeDirNullGraph());
|
||||
|
||||
IUT.verify();
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testDirSingleVertex()
|
||||
throws Throwable
|
||||
{
|
||||
AcyclicContract IUT =
|
||||
new AcyclicContract();
|
||||
IUT.setImpl(makeDirSingleVertex());
|
||||
IUT.verify();
|
||||
|
||||
try
|
||||
{
|
||||
IUT.addEdge(V1_V1, V1, V1);
|
||||
fail("No GraphException thrown when Self-Cycle introduced.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testSelfLoop()
|
||||
throws Throwable
|
||||
{
|
||||
AcyclicContract IUT =
|
||||
new AcyclicContract();
|
||||
IUT.setImpl(makeSelfLoop());
|
||||
|
||||
try
|
||||
{
|
||||
IUT.verify();
|
||||
fail("No CycleException thrown on Verification.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testDirDoubleVertex()
|
||||
throws Throwable
|
||||
{
|
||||
AcyclicContract IUT =
|
||||
new AcyclicContract();
|
||||
IUT.setImpl(makeDirDoubleVertex());
|
||||
IUT.verify();
|
||||
|
||||
try
|
||||
{
|
||||
IUT.addEdge(V1_V1, V1, V1);
|
||||
fail("No GraphException thrown when Self-Cycle introduced.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
|
||||
try
|
||||
{
|
||||
IUT.addEdge(V1_V2, V1, V2);
|
||||
}
|
||||
catch (GraphException ex)
|
||||
{
|
||||
fail("Contract prevented adding of valid edge. V1->V2");
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testDirectedEdge()
|
||||
throws Throwable
|
||||
{
|
||||
AcyclicContract IUT =
|
||||
new AcyclicContract();
|
||||
IUT.setImpl(makeDirectedEdge());
|
||||
IUT.verify();
|
||||
|
||||
try
|
||||
{
|
||||
IUT.addEdge(V1_V1, V1, V1);
|
||||
fail("No GraphException thrown when Self-Cycle introduced.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
|
||||
try
|
||||
{
|
||||
IUT.addEdge(V1_V2_, V1, V2);
|
||||
}
|
||||
catch (GraphException ex)
|
||||
{
|
||||
fail("Contract prevented adding of valid edge. V1->V2'");
|
||||
}
|
||||
|
||||
try
|
||||
{
|
||||
IUT.addEdge(V2_V1, V2, V1);
|
||||
fail("Contract allowed cycle to be introduced.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testDirParallelEdges()
|
||||
throws Throwable
|
||||
{
|
||||
AcyclicContract IUT =
|
||||
new AcyclicContract();
|
||||
IUT.setImpl(makeDirParallelEdges());
|
||||
IUT.verify();
|
||||
|
||||
try
|
||||
{
|
||||
IUT.addEdge(V1_V1, V1, V1);
|
||||
fail("No GraphException thrown when Self-Cycle introduced.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
|
||||
try
|
||||
{
|
||||
IUT.addEdge(V1_V2__, V1, V2);
|
||||
}
|
||||
catch (GraphException ex)
|
||||
{
|
||||
fail("Contract prevented adding of valid edge. V1->V2'");
|
||||
}
|
||||
|
||||
try
|
||||
{
|
||||
IUT.addEdge(V2_V1, V2, V1);
|
||||
fail("Contract allowed cycle to be introduced.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
}
|
||||
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testTwoCycle()
|
||||
throws Throwable
|
||||
{
|
||||
AcyclicContract IUT =
|
||||
new AcyclicContract();
|
||||
IUT.setImpl(makeTwoCycle());
|
||||
|
||||
try
|
||||
{
|
||||
IUT.verify();
|
||||
fail("No CycleException thrown on Verification.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
}
|
||||
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testDirectedCycle()
|
||||
throws Throwable
|
||||
{
|
||||
AcyclicContract IUT =
|
||||
new AcyclicContract();
|
||||
IUT.setImpl(makeDirectedCycle());
|
||||
|
||||
try
|
||||
{
|
||||
IUT.verify();
|
||||
fail("No CycleException thrown on Verification.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testPipe()
|
||||
throws Throwable
|
||||
{
|
||||
AcyclicContract IUT =
|
||||
new AcyclicContract();
|
||||
IUT.setImpl(makePipe());
|
||||
IUT.verify();
|
||||
|
||||
try
|
||||
{
|
||||
IUT.addEdge(V1_V1, V1, V1);
|
||||
fail("No GraphException thrown when Self-Cycle introduced.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
|
||||
try
|
||||
{
|
||||
IUT.addEdge(V1_V2_, V1, V2);
|
||||
}
|
||||
catch (GraphException ex)
|
||||
{
|
||||
fail("Contract prevented adding of valid edge. V1->V2'");
|
||||
}
|
||||
|
||||
try
|
||||
{
|
||||
IUT.addEdge(V3_V1, V3, V1);
|
||||
fail("Contract allowed cycle to be introduced.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testDiamond()
|
||||
throws Throwable
|
||||
{
|
||||
AcyclicContract IUT =
|
||||
new AcyclicContract();
|
||||
IUT.setImpl(makeDiamond());
|
||||
IUT.verify();
|
||||
|
||||
try
|
||||
{
|
||||
IUT.addEdge(V1_V1, V1, V1);
|
||||
fail("No GraphException thrown when Self-Cycle introduced.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
|
||||
try
|
||||
{
|
||||
IUT.addEdge(V2_V3, V2, V3);
|
||||
}
|
||||
catch (GraphException ex)
|
||||
{
|
||||
fail("Contract prevented adding of valid edge. V2->V3");
|
||||
}
|
||||
|
||||
try
|
||||
{
|
||||
IUT.addEdge(V4_V1, V4, V1);
|
||||
fail("Contract allowed cycle to be introduced.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testPipelessCycle()
|
||||
throws Throwable
|
||||
{
|
||||
AcyclicContract IUT =
|
||||
new AcyclicContract();
|
||||
IUT.setImpl(makePipelessCycle());
|
||||
IUT.verify();
|
||||
|
||||
try
|
||||
{
|
||||
IUT.addEdge(V1_V1, V1, V1);
|
||||
fail("No GraphException thrown when Self-Cycle introduced.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
|
||||
try
|
||||
{
|
||||
IUT.addEdge(V2_V3, V2, V3);
|
||||
}
|
||||
catch (GraphException ex)
|
||||
{
|
||||
fail("Contract prevented adding of valid edge. V2->V3");
|
||||
}
|
||||
|
||||
try
|
||||
{
|
||||
IUT.addEdge(V3_V4, V3, V4);
|
||||
fail("Contract allowed cycle to be introduced.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
|
||||
}
|
||||
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testParentTree()
|
||||
throws Throwable
|
||||
{
|
||||
System.err.println("---- PARENT TREE ----");
|
||||
AcyclicContract IUT =
|
||||
new AcyclicContract();
|
||||
IUT.setImpl(makeParentTree());
|
||||
IUT.verify();
|
||||
|
||||
try
|
||||
{
|
||||
IUT.addEdge(V1_V1, V1, V1);
|
||||
fail("No GraphException thrown when Self-Cycle introduced.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
|
||||
try
|
||||
{
|
||||
IUT.addEdge(V2_V3, V2, V3);
|
||||
}
|
||||
catch (GraphException ex)
|
||||
{
|
||||
fail("Contract prevented adding of valid edge. V2->V3");
|
||||
}
|
||||
|
||||
try
|
||||
{
|
||||
IUT.addEdge(V1_V5, V1, V5);
|
||||
fail("Contract allowed cycle to be introduced.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
}
|
||||
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testChildTree()
|
||||
throws Throwable
|
||||
{
|
||||
AcyclicContract IUT =
|
||||
new AcyclicContract();
|
||||
IUT.setImpl(makeChildTree());
|
||||
IUT.verify();
|
||||
|
||||
try
|
||||
{
|
||||
IUT.addEdge(V1_V1, V1, V1);
|
||||
fail("No GraphException thrown when Self-Cycle introduced.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
|
||||
try
|
||||
{
|
||||
IUT.addEdge(V2_V3, V2, V3);
|
||||
}
|
||||
catch (GraphException ex)
|
||||
{
|
||||
fail("Contract prevented adding of valid edge. V2->V3");
|
||||
}
|
||||
|
||||
try
|
||||
{
|
||||
IUT.addEdge(V5_V1, V5, V1);
|
||||
fail("Contract allowed cycle to be introduced.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
|
||||
}
|
||||
}
|
||||
@@ -1,275 +1,275 @@
|
||||
package org.apache.commons.graph.contract;
|
||||
|
||||
/**
|
||||
* DAGTest This test looks to verify that yes indeed contracts are being called
|
||||
* when created through the GraphFactory.
|
||||
*/
|
||||
|
||||
import org.apache.commons.graph.*;
|
||||
import org.apache.commons.graph.impl.*;
|
||||
import org.apache.commons.graph.contract.*;
|
||||
import org.apache.commons.graph.exception.*;
|
||||
|
||||
/**
|
||||
* Description of the Class
|
||||
*/
|
||||
public class DAGTest
|
||||
extends GraphTest
|
||||
{
|
||||
private Contract[] dagContracts = new Contract[1];
|
||||
private GraphFactory factory = new GraphFactory();
|
||||
private String testName = null;
|
||||
|
||||
/**
|
||||
* Constructor for the DAGTest object
|
||||
*
|
||||
* @param name
|
||||
*/
|
||||
public DAGTest(String name)
|
||||
{
|
||||
super(name);
|
||||
this.testName = name;
|
||||
}
|
||||
|
||||
/**
|
||||
* The JUnit setup method
|
||||
*/
|
||||
public void setUp()
|
||||
{
|
||||
dagContracts[0] = new AcyclicContract();
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testDAGSelfLoop()
|
||||
throws Throwable
|
||||
{
|
||||
DirectedGraph dg = null;
|
||||
try
|
||||
{
|
||||
try
|
||||
{
|
||||
dg = factory.makeDirectedGraph(dagContracts,
|
||||
true,
|
||||
makeSelfLoop());
|
||||
fail("Should not have created DAG.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
}
|
||||
catch (Throwable ex)
|
||||
{
|
||||
printGraph(ex, dg);
|
||||
throw ex;
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testDAGTwoLoop()
|
||||
throws Throwable
|
||||
{
|
||||
DirectedGraph dg = null;
|
||||
try
|
||||
{
|
||||
try
|
||||
{
|
||||
dg = factory.makeDirectedGraph(dagContracts,
|
||||
true,
|
||||
makeTwoCycle());
|
||||
fail("Should not have created DAG.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
}
|
||||
catch (Throwable ex)
|
||||
{
|
||||
printGraph(ex, dg);
|
||||
throw ex;
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testMakeDAGDirCycle()
|
||||
throws Throwable
|
||||
{
|
||||
MutableDirectedGraph mdg = null;
|
||||
try
|
||||
{
|
||||
mdg = factory.makeMutableDirectedGraph(dagContracts,
|
||||
true,
|
||||
null);
|
||||
mdg.addVertex(V1);
|
||||
mdg.addVertex(V2);
|
||||
mdg.addEdge(V1_V2, V1, V2);
|
||||
|
||||
mdg.addVertex(V3);
|
||||
mdg.addEdge(V2_V3, V2, V3);
|
||||
|
||||
try
|
||||
{
|
||||
mdg.addEdge(V3_V1, V3, V1);
|
||||
fail("No CycleException thrown on introduction of cycle.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
}
|
||||
catch (Throwable t)
|
||||
{
|
||||
printGraph(t, mdg);
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testDAGDirCycle()
|
||||
throws Throwable
|
||||
{
|
||||
DirectedGraph dg = null;
|
||||
try
|
||||
{
|
||||
try
|
||||
{
|
||||
dg = factory.makeDirectedGraph(dagContracts,
|
||||
true,
|
||||
makeDirectedCycle());
|
||||
fail("Should not have created DAG.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
}
|
||||
catch (Throwable ex)
|
||||
{
|
||||
printGraph(ex, dg);
|
||||
throw ex;
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testDAGAddCycleToPipe()
|
||||
throws Throwable
|
||||
{
|
||||
MutableDirectedGraph mdg = null;
|
||||
try
|
||||
{
|
||||
try
|
||||
{
|
||||
mdg = factory.makeMutableDirectedGraph(dagContracts,
|
||||
true,
|
||||
makePipe());
|
||||
mdg.addEdge(V3_V1, V3, V1);
|
||||
fail("No Exception thrown on adding of invalid edge.");
|
||||
}
|
||||
catch (CycleException e)
|
||||
{}
|
||||
}
|
||||
catch (Throwable ex)
|
||||
{
|
||||
printGraph(ex, mdg);
|
||||
throw ex;
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testDAGAddCycleToDirEdge()
|
||||
throws Throwable
|
||||
{
|
||||
MutableDirectedGraph mdg = null;
|
||||
try
|
||||
{
|
||||
try
|
||||
{
|
||||
mdg = factory.makeMutableDirectedGraph(dagContracts,
|
||||
true,
|
||||
makeDirectedEdge());
|
||||
mdg.addEdge(V2_V1, V2, V1);
|
||||
fail("Failed to throw exception on introducing Cycle.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
}
|
||||
catch (Throwable ex)
|
||||
{
|
||||
printGraph(ex, mdg);
|
||||
throw ex;
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testDAGAddSelfLoop()
|
||||
throws Throwable
|
||||
{
|
||||
MutableDirectedGraph mdg = null;
|
||||
try
|
||||
{
|
||||
try
|
||||
{
|
||||
mdg = factory.makeMutableDirectedGraph(dagContracts,
|
||||
true,
|
||||
makeDirSingleVertex());
|
||||
mdg.addEdge(V1_V1, V1, V1);
|
||||
fail("Failed to throw exception on introducing Self Loop.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
}
|
||||
catch (Throwable ex)
|
||||
{
|
||||
printGraph(ex, mdg);
|
||||
throw ex;
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testDAGValidEdge()
|
||||
throws Throwable
|
||||
{
|
||||
MutableDirectedGraph mdg = null;
|
||||
try
|
||||
{
|
||||
mdg = factory.makeMutableDirectedGraph(dagContracts,
|
||||
true,
|
||||
makeParentTree());
|
||||
mdg.addEdge(V2_V3, V2, V3);
|
||||
}
|
||||
catch (Throwable ex)
|
||||
{
|
||||
printGraph(ex, mdg);
|
||||
throw ex;
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testDAGValidEdge2()
|
||||
throws Throwable
|
||||
{
|
||||
MutableDirectedGraph mdg = null;
|
||||
try
|
||||
{
|
||||
mdg = factory.makeMutableDirectedGraph(dagContracts,
|
||||
true,
|
||||
makeDirDoubleVertex());
|
||||
mdg.addEdge(V1_V2, V1, V2);
|
||||
}
|
||||
catch (Throwable ex)
|
||||
{
|
||||
printGraph(ex, mdg);
|
||||
throw ex;
|
||||
}
|
||||
}
|
||||
}
|
||||
package org.apache.commons.graph.contract;
|
||||
|
||||
/**
|
||||
* DAGTest This test looks to verify that yes indeed contracts are being called
|
||||
* when created through the GraphFactory.
|
||||
*/
|
||||
|
||||
import org.apache.commons.graph.*;
|
||||
import org.apache.commons.graph.contract.*;
|
||||
import org.apache.commons.graph.exception.*;
|
||||
import org.apache.commons.graph.factory.*;
|
||||
|
||||
/**
|
||||
* Description of the Class
|
||||
*/
|
||||
public class DAGTest
|
||||
extends GraphTest
|
||||
{
|
||||
private Contract[] dagContracts = new Contract[1];
|
||||
private GraphFactory factory = new GraphFactory();
|
||||
private String testName = null;
|
||||
|
||||
/**
|
||||
* Constructor for the DAGTest object
|
||||
*
|
||||
* @param name
|
||||
*/
|
||||
public DAGTest(String name)
|
||||
{
|
||||
super(name);
|
||||
this.testName = name;
|
||||
}
|
||||
|
||||
/**
|
||||
* The JUnit setup method
|
||||
*/
|
||||
public void setUp()
|
||||
{
|
||||
dagContracts[0] = new AcyclicContract();
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testDAGSelfLoop()
|
||||
throws Throwable
|
||||
{
|
||||
DirectedGraph dg = null;
|
||||
try
|
||||
{
|
||||
try
|
||||
{
|
||||
dg = factory.makeDirectedGraph(dagContracts,
|
||||
true,
|
||||
makeSelfLoop());
|
||||
fail("Should not have created DAG.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
}
|
||||
catch (Throwable ex)
|
||||
{
|
||||
printGraph(ex, dg);
|
||||
throw ex;
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testDAGTwoLoop()
|
||||
throws Throwable
|
||||
{
|
||||
DirectedGraph dg = null;
|
||||
try
|
||||
{
|
||||
try
|
||||
{
|
||||
dg = factory.makeDirectedGraph(dagContracts,
|
||||
true,
|
||||
makeTwoCycle());
|
||||
fail("Should not have created DAG.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
}
|
||||
catch (Throwable ex)
|
||||
{
|
||||
printGraph(ex, dg);
|
||||
throw ex;
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testMakeDAGDirCycle()
|
||||
throws Throwable
|
||||
{
|
||||
MutableDirectedGraph mdg = null;
|
||||
try
|
||||
{
|
||||
mdg = factory.makeMutableDirectedGraph(dagContracts,
|
||||
true,
|
||||
null);
|
||||
mdg.addVertex(V1);
|
||||
mdg.addVertex(V2);
|
||||
mdg.addEdge(V1_V2, V1, V2);
|
||||
|
||||
mdg.addVertex(V3);
|
||||
mdg.addEdge(V2_V3, V2, V3);
|
||||
|
||||
try
|
||||
{
|
||||
mdg.addEdge(V3_V1, V3, V1);
|
||||
fail("No CycleException thrown on introduction of cycle.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
}
|
||||
catch (Throwable t)
|
||||
{
|
||||
printGraph(t, mdg);
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testDAGDirCycle()
|
||||
throws Throwable
|
||||
{
|
||||
DirectedGraph dg = null;
|
||||
try
|
||||
{
|
||||
try
|
||||
{
|
||||
dg = factory.makeDirectedGraph(dagContracts,
|
||||
true,
|
||||
makeDirectedCycle());
|
||||
fail("Should not have created DAG.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
}
|
||||
catch (Throwable ex)
|
||||
{
|
||||
printGraph(ex, dg);
|
||||
throw ex;
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testDAGAddCycleToPipe()
|
||||
throws Throwable
|
||||
{
|
||||
MutableDirectedGraph mdg = null;
|
||||
try
|
||||
{
|
||||
try
|
||||
{
|
||||
mdg = factory.makeMutableDirectedGraph(dagContracts,
|
||||
true,
|
||||
makePipe());
|
||||
mdg.addEdge(V3_V1, V3, V1);
|
||||
fail("No Exception thrown on adding of invalid edge.");
|
||||
}
|
||||
catch (CycleException e)
|
||||
{}
|
||||
}
|
||||
catch (Throwable ex)
|
||||
{
|
||||
printGraph(ex, mdg);
|
||||
throw ex;
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testDAGAddCycleToDirEdge()
|
||||
throws Throwable
|
||||
{
|
||||
MutableDirectedGraph mdg = null;
|
||||
try
|
||||
{
|
||||
try
|
||||
{
|
||||
mdg = factory.makeMutableDirectedGraph(dagContracts,
|
||||
true,
|
||||
makeDirectedEdge());
|
||||
mdg.addEdge(V2_V1, V2, V1);
|
||||
fail("Failed to throw exception on introducing Cycle.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
}
|
||||
catch (Throwable ex)
|
||||
{
|
||||
printGraph(ex, mdg);
|
||||
throw ex;
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testDAGAddSelfLoop()
|
||||
throws Throwable
|
||||
{
|
||||
MutableDirectedGraph mdg = null;
|
||||
try
|
||||
{
|
||||
try
|
||||
{
|
||||
mdg = factory.makeMutableDirectedGraph(dagContracts,
|
||||
true,
|
||||
makeDirSingleVertex());
|
||||
mdg.addEdge(V1_V1, V1, V1);
|
||||
fail("Failed to throw exception on introducing Self Loop.");
|
||||
}
|
||||
catch (CycleException ex)
|
||||
{}
|
||||
}
|
||||
catch (Throwable ex)
|
||||
{
|
||||
printGraph(ex, mdg);
|
||||
throw ex;
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testDAGValidEdge()
|
||||
throws Throwable
|
||||
{
|
||||
MutableDirectedGraph mdg = null;
|
||||
try
|
||||
{
|
||||
mdg = factory.makeMutableDirectedGraph(dagContracts,
|
||||
true,
|
||||
makeParentTree());
|
||||
mdg.addEdge(V2_V3, V2, V3);
|
||||
}
|
||||
catch (Throwable ex)
|
||||
{
|
||||
printGraph(ex, mdg);
|
||||
throw ex;
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* A unit test for JUnit
|
||||
*/
|
||||
public void testDAGValidEdge2()
|
||||
throws Throwable
|
||||
{
|
||||
MutableDirectedGraph mdg = null;
|
||||
try
|
||||
{
|
||||
mdg = factory.makeMutableDirectedGraph(dagContracts,
|
||||
true,
|
||||
makeDirDoubleVertex());
|
||||
mdg.addEdge(V1_V2, V1, V2);
|
||||
}
|
||||
catch (Throwable ex)
|
||||
{
|
||||
printGraph(ex, mdg);
|
||||
throw ex;
|
||||
}
|
||||
}
|
||||
}
|
||||
Reference in new issue
Block a user