ra.setMaxVisitedNodes(opts.getMaxVisitedNodes()); return ra;
@Test public void testMaxVisitedNodes() { GraphHopperStorage graph = createGHStorage(false); initBiGraph(graph); RoutingAlgorithm algo = createAlgo(graph); Path p = algo.calcPath(0, 4); assertTrue(p.isFound()); algo = createAlgo(graph); algo.setMaxVisitedNodes(3); p = algo.calcPath(0, 4); assertFalse(p.isFound()); }
ra.setMaxVisitedNodes(opts.getMaxVisitedNodes()); return ra;
ra.setMaxVisitedNodes(opts.getMaxVisitedNodes()); return ra;
ra.setMaxVisitedNodes(opts.getMaxVisitedNodes()); return ra;
router.setMaxVisitedNodes(maxVisitedNodes); } else { router = new DijkstraBidirectionRef(queryGraph, weighting, TraversalMode.NODE_BASED) { router.setMaxVisitedNodes(maxVisitedNodes);
router.setMaxVisitedNodes(maxVisitedNodes); } else { router = new DijkstraBidirectionRef(queryGraph, weighting, TraversalMode.NODE_BASED) { router.setMaxVisitedNodes(maxVisitedNodes);