tom | 2e1f071 | 2014-08-29 13:32:00 -0700 | [diff] [blame] | 1 | package org.onlab.graph; |
| 2 | |
| 3 | import org.junit.Test; |
| 4 | |
| 5 | import java.util.HashSet; |
| 6 | import java.util.Set; |
| 7 | |
| 8 | import static org.junit.Assert.assertEquals; |
| 9 | |
| 10 | /** |
| 11 | * Test of the Bellman-Ford algorithm. |
| 12 | */ |
| 13 | public class BellmanFordGraphSearchTest extends BreadthFirstSearchTest { |
| 14 | |
| 15 | @Override |
| 16 | protected AbstractGraphPathSearch<TestVertex, TestEdge> graphSearch() { |
| 17 | return new BellmanFordGraphSearch<>(); |
| 18 | } |
| 19 | |
| 20 | @Test |
| 21 | @Override |
| 22 | public void defaultGraphTest() { |
| 23 | executeDefaultTest(7, 5, 5.0); |
| 24 | } |
| 25 | |
| 26 | @Test |
| 27 | public void defaultHopCountWeight() { |
| 28 | weight = null; |
| 29 | executeDefaultTest(10, 3, 3.0); |
| 30 | } |
| 31 | |
| 32 | @Test |
| 33 | public void searchGraphWithNegativeCycles() { |
tom | 0633d68 | 2014-09-10 12:10:03 -0700 | [diff] [blame] | 34 | Set<TestVertex> vertexes = new HashSet<>(vertexes()); |
tom | 2e1f071 | 2014-08-29 13:32:00 -0700 | [diff] [blame] | 35 | vertexes.add(Z); |
| 36 | |
| 37 | Set<TestEdge> edges = new HashSet<>(edges()); |
| 38 | edges.add(new TestEdge(G, Z, 1.0)); |
| 39 | edges.add(new TestEdge(Z, G, -2.0)); |
| 40 | |
tom | 0633d68 | 2014-09-10 12:10:03 -0700 | [diff] [blame] | 41 | graph = new AdjacencyListsGraph<>(vertexes, edges); |
tom | 2e1f071 | 2014-08-29 13:32:00 -0700 | [diff] [blame] | 42 | |
| 43 | GraphPathSearch<TestVertex, TestEdge> search = graphSearch(); |
tom | 0633d68 | 2014-09-10 12:10:03 -0700 | [diff] [blame] | 44 | Set<Path<TestVertex, TestEdge>> paths = search.search(graph, A, H, weight).paths(); |
tom | 2e1f071 | 2014-08-29 13:32:00 -0700 | [diff] [blame] | 45 | assertEquals("incorrect paths count", 1, paths.size()); |
| 46 | |
| 47 | Path p = paths.iterator().next(); |
| 48 | assertEquals("incorrect src", A, p.src()); |
| 49 | assertEquals("incorrect dst", H, p.dst()); |
| 50 | assertEquals("incorrect path length", 5, p.edges().size()); |
| 51 | assertEquals("incorrect path cost", 5.0, p.cost(), 0.1); |
| 52 | |
tom | 0633d68 | 2014-09-10 12:10:03 -0700 | [diff] [blame] | 53 | paths = search.search(graph, A, G, weight).paths(); |
tom | 2e1f071 | 2014-08-29 13:32:00 -0700 | [diff] [blame] | 54 | assertEquals("incorrect paths count", 0, paths.size()); |
| 55 | |
tom | 0633d68 | 2014-09-10 12:10:03 -0700 | [diff] [blame] | 56 | paths = search.search(graph, A, null, weight).paths(); |
tom | 2e1f071 | 2014-08-29 13:32:00 -0700 | [diff] [blame] | 57 | printPaths(paths); |
| 58 | assertEquals("incorrect paths count", 6, paths.size()); |
| 59 | } |
| 60 | |
| 61 | } |