svn commit: r1137189 - in /commons/sandbox/graph/trunk/src/test/java/org/apache/commons/graph/visit: ./ VisitTestCase.java

[si...@apache.org]

Author: simonetripodi
Date: Sat Jun 18 14:02:49 2011
New Revision: 1137189

URL: http://svn.apache.org/viewvc?rev=1137189&view=rev
Log:
first checkin of visit algorithms tes case class

Added:
    commons/sandbox/graph/trunk/src/test/java/org/apache/commons/graph/visit/
    commons/sandbox/graph/trunk/src/test/java/org/apache/commons/graph/visit/VisitTestCase.java   (with props)

Added: commons/sandbox/graph/trunk/src/test/java/org/apache/commons/graph/visit/VisitTestCase.java
URL: http://svn.apache.org/viewvc/commons/sandbox/graph/trunk/src/test/java/org/apache/commons/graph/visit/VisitTestCase.java?rev=1137189&view=auto
==============================================================================
--- commons/sandbox/graph/trunk/src/test/java/org/apache/commons/graph/visit/VisitTestCase.java (added)
+++ commons/sandbox/graph/trunk/src/test/java/org/apache/commons/graph/visit/VisitTestCase.java Sat Jun 18 14:02:49 2011
@@ -0,0 +1,116 @@
+package org.apache.commons.graph.visit;
+
+/*
+ * Licensed to the Apache Software Foundation (ASF) under one
+ * or more contributor license agreements.  See the NOTICE file
+ * distributed with this work for additional information
+ * regarding copyright ownership.  The ASF licenses this file
+ * to you under the Apache License, Version 2.0 (the
+ * "License"); you may not use this file except in compliance
+ * with the License.  You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing,
+ * software distributed under the License is distributed on an
+ * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
+ * KIND, either express or implied.  See the License for the
+ * specific language governing permissions and limitations
+ * under the License.
+ */
+
+import static org.apache.commons.graph.visit.Visit.breadthFirstSearch;
+import static org.apache.commons.graph.visit.Visit.depthFirstSearch;
+import static org.junit.Assert.assertEquals;
+
+import org.apache.commons.graph.Graph;
+import org.apache.commons.graph.model.BaseLabeledEdge;
+import org.apache.commons.graph.model.BaseLabeledVertex;
+import org.apache.commons.graph.model.UndirectedMutableGraph;
+import org.junit.Ignore;
+import org.junit.Test;
+
+public final class VisitTestCase
+{
+
+    /**
+     * Graph picture can be see
+     * <a href="http://www.personal.kent.edu/~rmuhamma/Algorithms/MyAlgorithms/GraphAlgor/breadthSearch.htm">here</a>
+     */
+    @Test
+    public void verifyBreadthFirstSearch()
+    {
+        // vertices
+
+        BaseLabeledVertex r = new BaseLabeledVertex( "r" );
+        BaseLabeledVertex s = new BaseLabeledVertex( "s" );
+        BaseLabeledVertex t = new BaseLabeledVertex( "t" );
+        BaseLabeledVertex u = new BaseLabeledVertex( "u" );
+        BaseLabeledVertex v = new BaseLabeledVertex( "v" );
+        BaseLabeledVertex w = new BaseLabeledVertex( "w" );
+        BaseLabeledVertex x = new BaseLabeledVertex( "x" );
+        BaseLabeledVertex y = new BaseLabeledVertex( "y" );
+
+        // input graph
+
+        UndirectedMutableGraph<BaseLabeledVertex, BaseLabeledEdge> input =
+            new UndirectedMutableGraph<BaseLabeledVertex, BaseLabeledEdge>();
+
+        input.addVertex( r );
+        input.addVertex( s );
+        input.addVertex( t );
+        input.addVertex( u );
+        input.addVertex( v );
+        input.addVertex( w );
+        input.addVertex( x );
+        input.addVertex( y );
+
+        input.addEdge( new BaseLabeledEdge( "", s, r ) );
+        input.addEdge( new BaseLabeledEdge( "", s, w ) );
+
+        input.addEdge( new BaseLabeledEdge( "", r, v ) );
+
+        input.addEdge( new BaseLabeledEdge( "", w, t ) );
+        input.addEdge( new BaseLabeledEdge( "", w, x ) );
+
+        input.addEdge( new BaseLabeledEdge( "", t, u ) );
+        input.addEdge( new BaseLabeledEdge( "", t, x ) );
+
+        input.addEdge( new BaseLabeledEdge( "", y, u ) );
+        input.addEdge( new BaseLabeledEdge( "", y, x ) );
+
+        // expected graph
+
+        UndirectedMutableGraph<BaseLabeledVertex, BaseLabeledEdge> expected =
+            new UndirectedMutableGraph<BaseLabeledVertex, BaseLabeledEdge>();
+
+        for ( BaseLabeledVertex vertex : input.getVertices() )
+        {
+            expected.addVertex( vertex );
+        }
+
+        expected.addEdge( new BaseLabeledEdge( "", s, r ) );
+        expected.addEdge( new BaseLabeledEdge( "", s, w ) );
+        expected.addEdge( new BaseLabeledEdge( "", r, v ) );
+        expected.addEdge( new BaseLabeledEdge( "", w, t ) );
+        expected.addEdge( new BaseLabeledEdge( "", w, x ) );
+        expected.addEdge( new BaseLabeledEdge( "", t, u ) );
+        expected.addEdge( new BaseLabeledEdge( "", y, x ) );
+
+        // actual graph
+
+        Graph<BaseLabeledVertex, BaseLabeledEdge> actual = breadthFirstSearch( input, s );
+
+        // assertion
+
+        assertEquals( expected, actual );
+    }
+
+    @Test
+    @Ignore
+    public void verifyDepthFirstSearch()
+    {
+        depthFirstSearch( null, null );
+    }
+
+}

Propchange: commons/sandbox/graph/trunk/src/test/java/org/apache/commons/graph/visit/VisitTestCase.java
------------------------------------------------------------------------------
    svn:eol-style = native

Propchange: commons/sandbox/graph/trunk/src/test/java/org/apache/commons/graph/visit/VisitTestCase.java
------------------------------------------------------------------------------
    svn:keywords = Date Author Id Revision HeadURL

Propchange: commons/sandbox/graph/trunk/src/test/java/org/apache/commons/graph/visit/VisitTestCase.java
------------------------------------------------------------------------------
    svn:mime-type = text/plain