@Test public void testCalcIfEmptyWay() { Path p = createAlgo(createTestStorage()).calcPath(0, 0); assertEquals(p.calcNodes().toString(), 1, p.calcNodes().size()); assertEquals(p.toString(), 0, p.getDistance(), 1e-4); }
@Test public void testViaEdges_WithCoordinates() { GraphHopperStorage ghStorage = createTestStorage(); Path p = calcPath(ghStorage, 0, 1, 2, 3); assertEquals(IntArrayList.from(new int[]{8, 1, 2, 9}), p.calcNodes()); assertEquals(p.toString(), 56.7, p.getDistance(), .1); }
@Test public void testCalcIf1EdgeAway() { Path p = createAlgo(createTestStorage()).calcPath(1, 2); assertEquals(IntArrayList.from(new int[]{1, 2}), p.calcNodes()); assertEquals(p.toString(), 35.1, p.getDistance(), .1); }
@Test public void testCalcShortestPath() { GraphHopperStorage ghStorage = createTestStorage(); RoutingAlgorithm algo = createAlgo(ghStorage); Path p = algo.calcPath(0, 7); assertEquals(p.toString(), IntArrayList.from(new int[]{0, 4, 5, 7}), p.calcNodes()); assertEquals(p.toString(), 62.1, p.getDistance(), .1); }
@Test public void testViaEdges_FromEqualsTo() { GraphHopperStorage ghStorage = createTestStorage(); // identical tower nodes Path p = calcPathViaQuery(ghStorage, 0.001, 0.000, 0.001, 0.000); assertTrue(p.isFound()); assertEquals(IntArrayList.from(new int[]{0}), p.calcNodes()); // assertEquals(1, p.calcPoints().size()); assertEquals(p.toString(), 0, p.getDistance(), 1e-4); // identical query points on edge p = calcPath(ghStorage, 0, 1, 0, 1); assertTrue(p.isFound()); assertEquals(IntArrayList.from(new int[]{8}), p.calcNodes()); // assertEquals(1, p.calcPoints().size()); assertEquals(p.toString(), 0, p.getDistance(), 1e-4); // very close p = calcPathViaQuery(ghStorage, 0.00092, 0, 0.00091, 0); assertEquals(IntArrayList.from(new int[]{8, 9}), p.calcNodes()); assertEquals(p.toString(), 1.11, p.getDistance(), .1); }