diff options
Diffstat (limited to 'framework/src/onos/utils/misc/src/test/java/org/onlab/graph/DepthFirstSearchTest.java')
-rw-r--r-- | framework/src/onos/utils/misc/src/test/java/org/onlab/graph/DepthFirstSearchTest.java | 97 |
1 files changed, 97 insertions, 0 deletions
diff --git a/framework/src/onos/utils/misc/src/test/java/org/onlab/graph/DepthFirstSearchTest.java b/framework/src/onos/utils/misc/src/test/java/org/onlab/graph/DepthFirstSearchTest.java new file mode 100644 index 00000000..3977ebf1 --- /dev/null +++ b/framework/src/onos/utils/misc/src/test/java/org/onlab/graph/DepthFirstSearchTest.java @@ -0,0 +1,97 @@ +/* + * Copyright 2014-2015 Open Networking Laboratory + * + * Licensed 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. + */ +package org.onlab.graph; + +import org.junit.Test; + +import java.util.Set; + +import static org.junit.Assert.assertEquals; +import static org.junit.Assert.assertTrue; +import static org.onlab.graph.DepthFirstSearch.EdgeType; +import static org.onlab.graph.GraphPathSearch.ALL_PATHS; + +/** + * Test of the DFS algorithm. + */ +public class DepthFirstSearchTest extends AbstractGraphPathSearchTest { + + @Override + protected DepthFirstSearch<TestVertex, TestEdge> graphSearch() { + return new DepthFirstSearch<>(); + } + + @Test + public void defaultGraphTest() { + executeDefaultTest(3, 6, 5.0, 12.0); + executeBroadSearch(); + } + + @Test + public void defaultHopCountWeight() { + weight = null; + executeDefaultTest(3, 6, 3.0, 6.0); + executeBroadSearch(); + } + + protected void executeDefaultTest(int minLength, int maxLength, + double minCost, double maxCost) { + graph = new AdjacencyListsGraph<>(vertexes(), edges()); + DepthFirstSearch<TestVertex, TestEdge> search = graphSearch(); + + DepthFirstSearch<TestVertex, TestEdge>.SpanningTreeResult result = + search.search(graph, A, H, weight, 1); + Set<Path<TestVertex, TestEdge>> paths = result.paths(); + assertEquals("incorrect path count", 1, paths.size()); + + Path path = paths.iterator().next(); + System.out.println(path); + assertEquals("incorrect src", A, path.src()); + assertEquals("incorrect dst", H, path.dst()); + + int l = path.edges().size(); + assertTrue("incorrect path length " + l, + minLength <= l && l <= maxLength); + assertTrue("incorrect path cost " + path.cost(), + minCost <= path.cost() && path.cost() <= maxCost); + + System.out.println(result.edges()); + printPaths(paths); + } + + public void executeBroadSearch() { + graph = new AdjacencyListsGraph<>(vertexes(), edges()); + DepthFirstSearch<TestVertex, TestEdge> search = graphSearch(); + + // Perform narrow path search to a specific destination. + DepthFirstSearch<TestVertex, TestEdge>.SpanningTreeResult result = + search.search(graph, A, null, weight, ALL_PATHS); + assertEquals("incorrect paths count", 7, result.paths().size()); + + int[] types = new int[]{0, 0, 0, 0}; + for (EdgeType t : result.edges().values()) { + types[t.ordinal()] += 1; + } + assertEquals("incorrect tree-edge count", 7, + types[EdgeType.TREE_EDGE.ordinal()]); + assertEquals("incorrect back-edge count", 1, + types[EdgeType.BACK_EDGE.ordinal()]); + assertEquals("incorrect cross-edge & forward-edge count", 4, + types[EdgeType.FORWARD_EDGE.ordinal()] + + types[EdgeType.CROSS_EDGE.ordinal()]); + } + +} |