blob: cf35f666d109773ddcc6bb9ffdbdd1ae91eef15c [file] [log] [blame]
Thomas Vachuska24c849c2014-10-27 09:53:05 -07001/*
Thomas Vachuska4f1a60c2014-10-28 13:39:07 -07002 * Copyright 2014 Open Networking Laboratory
Thomas Vachuska24c849c2014-10-27 09:53:05 -07003 *
Thomas Vachuska4f1a60c2014-10-28 13:39:07 -07004 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
Thomas Vachuska24c849c2014-10-27 09:53:05 -07007 *
Thomas Vachuska4f1a60c2014-10-28 13:39:07 -07008 * http://www.apache.org/licenses/LICENSE-2.0
9 *
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
Thomas Vachuska24c849c2014-10-27 09:53:05 -070015 */
tom144de692014-08-29 11:38:44 -070016package org.onlab.graph;
17
18import org.junit.Test;
19
20import static com.google.common.collect.ImmutableSet.of;
21import static org.junit.Assert.assertEquals;
22
23/**
24 * Base for all graph search tests.
25 */
26public abstract class AbstractGraphPathSearchTest extends GraphTest {
27
28 /**
29 * Creates a test-specific graph search to exercise.
30 *
31 * @return graph search
32 */
33 protected abstract AbstractGraphPathSearch<TestVertex, TestEdge> graphSearch();
34
35 @Test(expected = IllegalArgumentException.class)
36 public void noSuchSourceArgument() {
37 graphSearch().search(new AdjacencyListsGraph<>(of(B, C),
38 of(new TestEdge(B, C, 1))),
39 A, H, weight);
40 }
41
42 @Test(expected = NullPointerException.class)
43 public void nullGraphArgument() {
44 graphSearch().search(null, A, H, weight);
45 }
46
47 @Test(expected = NullPointerException.class)
48 public void nullSourceArgument() {
49 graphSearch().search(new AdjacencyListsGraph<>(of(B, C),
50 of(new TestEdge(B, C, 1))),
51 null, H, weight);
52 }
53
54 @Test
55 public void samenessThreshold() {
56 AbstractGraphPathSearch<TestVertex, TestEdge> search = graphSearch();
57 search.setSamenessThreshold(0.3);
58 assertEquals("incorrect threshold", 0.3, search.samenessThreshold(), 0.01);
59 }
60
61}