| |
|
| org.geotools.graph.util.DijkstraShortestPathFinderTest
DijkstraShortestPathFinderTest | public class DijkstraShortestPathFinderTest extends TestCase (Code) | | |
DijkstraShortestPathFinderTest | public DijkstraShortestPathFinderTest(String name)(Code) | | |
test_0 | public void test_0()(Code) | | Create a graph with no bifurcations and calculate path from beginning
to end.
Expected: 1. Path should contain every node in graph in order.
|
test_1 | public void test_1()(Code) | | Create a circular graph and calculate a path from beginning to end.
Expected: 1. Path should just contain end nodes.
|
test_2 | public void test_2()(Code) | | Create a balanced binary tree and calculate a path from root to a leaf.
Expected 1. Path should be links from leaf to root.
|
|
|
|