Thomas Vachuska | 24c849c | 2014-10-27 09:53:05 -0700 | [diff] [blame] | 1 | /* |
Ray Milkey | 34c9590 | 2015-04-15 09:47:53 -0700 | [diff] [blame] | 2 | * Copyright 2014-2015 Open Networking Laboratory |
Thomas Vachuska | 24c849c | 2014-10-27 09:53:05 -0700 | [diff] [blame] | 3 | * |
Thomas Vachuska | 4f1a60c | 2014-10-28 13:39:07 -0700 | [diff] [blame] | 4 | * 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 Vachuska | 24c849c | 2014-10-27 09:53:05 -0700 | [diff] [blame] | 7 | * |
Thomas Vachuska | 4f1a60c | 2014-10-28 13:39:07 -0700 | [diff] [blame] | 8 | * 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 Vachuska | 24c849c | 2014-10-27 09:53:05 -0700 | [diff] [blame] | 15 | */ |
tom | 144de69 | 2014-08-29 11:38:44 -0700 | [diff] [blame] | 16 | package org.onlab.graph; |
| 17 | |
| 18 | import org.junit.Test; |
| 19 | |
| 20 | import static com.google.common.collect.ImmutableSet.of; |
| 21 | import static org.junit.Assert.assertEquals; |
| 22 | |
| 23 | /** |
| 24 | * Base for all graph search tests. |
| 25 | */ |
| 26 | public 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))), |
Thomas Vachuska | c31d9f1 | 2015-01-22 12:33:27 -0800 | [diff] [blame] | 39 | A, H, weight, 1); |
tom | 144de69 | 2014-08-29 11:38:44 -0700 | [diff] [blame] | 40 | } |
| 41 | |
| 42 | @Test(expected = NullPointerException.class) |
| 43 | public void nullGraphArgument() { |
Thomas Vachuska | c31d9f1 | 2015-01-22 12:33:27 -0800 | [diff] [blame] | 44 | graphSearch().search(null, A, H, weight, 1); |
tom | 144de69 | 2014-08-29 11:38:44 -0700 | [diff] [blame] | 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))), |
Thomas Vachuska | c31d9f1 | 2015-01-22 12:33:27 -0800 | [diff] [blame] | 51 | null, H, weight, 1); |
tom | 144de69 | 2014-08-29 11:38:44 -0700 | [diff] [blame] | 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 | } |