Author: simonetripodi
Date: Thu Jun 16 21:17:37 2011
New Revision: 1136685
URL: http://svn.apache.org/viewvc?rev=1136685&view=rev
Log:
first checkin of successful Dijkstra's algorithm test case
Added:
commons/sandbox/graph/trunk/src/test/java/org/apache/commons/graph/shortestpath/
commons/sandbox/graph/trunk/src/test/java/org/apache/commons/graph/shortestpath/DijkstraTestCase.java
(with props)
Added:
commons/sandbox/graph/trunk/src/test/java/org/apache/commons/graph/shortestpath/DijkstraTestCase.java
URL:
http://svn.apache.org/viewvc/commons/sandbox/graph/trunk/src/test/java/org/apache/commons/graph/shortestpath/DijkstraTestCase.java?rev=1136685&view=auto
==============================================================================
---
commons/sandbox/graph/trunk/src/test/java/org/apache/commons/graph/shortestpath/DijkstraTestCase.java
(added)
+++
commons/sandbox/graph/trunk/src/test/java/org/apache/commons/graph/shortestpath/DijkstraTestCase.java
Thu Jun 16 21:17:37 2011
@@ -0,0 +1,92 @@
+package org.apache.commons.graph.shortestpath;
+
+import org.apache.commons.graph.Path;
+import org.apache.commons.graph.model.BaseLabeledVertex;
+import org.apache.commons.graph.model.BaseLabeledWeightedEdge;
+import org.apache.commons.graph.model.DirectedMutableWeightedGraph;
+import org.apache.commons.graph.model.InMemoryPath;
+import org.junit.Test;
+
+/*
+ * 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.shortestpath.Dijkstra.findShortestPath;
+import static junit.framework.Assert.assertEquals;
+
+public final class DijkstraTestCase
+{
+
+ /**
+ * Test Graph and Dijkstra's solution can be seen on
+ * Wikipedia {@link http://en.wikipedia.org/wiki/Dijkstra's_algorithm}
+ */
+ @Test
+ public void shortestPath1()
+ {
+ // test Graph
+
+ BaseLabeledVertex one = new BaseLabeledVertex( "1" );
+ BaseLabeledVertex two = new BaseLabeledVertex( "2" );
+ BaseLabeledVertex three = new BaseLabeledVertex( "3" );
+ BaseLabeledVertex four = new BaseLabeledVertex( "4" );
+ BaseLabeledVertex five = new BaseLabeledVertex( "5" );
+ BaseLabeledVertex six = new BaseLabeledVertex( "6" );
+
+ DirectedMutableWeightedGraph<BaseLabeledVertex,
BaseLabeledWeightedEdge> testGraph =
+ new DirectedMutableWeightedGraph<BaseLabeledVertex,
BaseLabeledWeightedEdge>();
+
+ testGraph.addVertex( one );
+ testGraph.addVertex( two );
+ testGraph.addVertex( three );
+ testGraph.addVertex( four );
+ testGraph.addVertex( five );
+ testGraph.addVertex( six );
+
+ testGraph.addEdge( new BaseLabeledWeightedEdge( "", one, six, 14D ) );
+ testGraph.addEdge( new BaseLabeledWeightedEdge( "", one, three, 9D ) );
+ testGraph.addEdge( new BaseLabeledWeightedEdge( "", one, two, 7D ) );
+
+ testGraph.addEdge( new BaseLabeledWeightedEdge( "", two, three, 10D )
);
+ testGraph.addEdge( new BaseLabeledWeightedEdge( "", two, four, 15D ) );
+
+ testGraph.addEdge( new BaseLabeledWeightedEdge( "", three, six, 2D ) );
+ testGraph.addEdge( new BaseLabeledWeightedEdge( "", three, four, 11D )
);
+
+ testGraph.addEdge( new BaseLabeledWeightedEdge( "", four, five, 6D ) );
+ testGraph.addEdge( new BaseLabeledWeightedEdge( "", six, five, 9D ) );
+
+ // expected path
+
+ Path<BaseLabeledVertex, BaseLabeledWeightedEdge> actual =
findShortestPath( testGraph, one, five );
+
+ InMemoryPath<BaseLabeledVertex, BaseLabeledWeightedEdge> expected =
+ new InMemoryPath<BaseLabeledVertex, BaseLabeledWeightedEdge>( one,
five, 20D );
+
+ expected.addVertexInTail( three );
+ expected.addVertexInTail( six );
+ expected.addVertexInTail( five );
+
+ expected.addEdgeInTail( new BaseLabeledWeightedEdge( "", one, three,
9D ) );
+ expected.addEdgeInTail( new BaseLabeledWeightedEdge( "", three, six,
2D ) );
+ expected.addEdgeInTail( new BaseLabeledWeightedEdge( "", six, five, 9D
) );
+
+ assertEquals( expected, actual );
+ }
+
+}
Propchange:
commons/sandbox/graph/trunk/src/test/java/org/apache/commons/graph/shortestpath/DijkstraTestCase.java
------------------------------------------------------------------------------
svn:eol-style = native
Propchange:
commons/sandbox/graph/trunk/src/test/java/org/apache/commons/graph/shortestpath/DijkstraTestCase.java
------------------------------------------------------------------------------
svn:keywords = Date Author Id Revision HeadURL
Propchange:
commons/sandbox/graph/trunk/src/test/java/org/apache/commons/graph/shortestpath/DijkstraTestCase.java
------------------------------------------------------------------------------
svn:mime-type = text/plain
