public BackwardDijkstraMultipleDestinations(final Network network, final TravelDisutility costFunction, final TravelTime timeFunction, final PreProcessDijkstra preProcessData) { super(network, costFunction, timeFunction, preProcessData); this.network = network; this.costFunction = costFunction; this.timeFunction = timeFunction; if (preProcessData != null) { if (preProcessData.containsData() == false) { this.pruneDeadEnds = false; log.warn("The preprocessing data provided to router class Dijkstra contains no data! Please execute its run(...) method first!"); log.warn("Running without dead-end pruning."); } else { this.pruneDeadEnds = true; } } else { this.pruneDeadEnds = false; } }
if (preProcessData.containsData() == false) { this.pruneDeadEnds = false; log.warn("The preprocessing data provided to router class Dijkstra contains no data! Please execute its run(...) method first!");
if (!preProcessData.containsData()) { this.pruneDeadEnds = false; log.warn("The preprocessing data provided to router class Dijkstra contains no data! Please execute its run(...) method first!");
@Override public LeastCostPathCalculator createPathCalculator(final Network network, final TravelDisutility travelCosts, final TravelTime travelTimes) { RoutingNetwork routingNetwork = this.routingNetworks.get(network); PreProcessDijkstra preProcessDijkstra = this.preProcessData.get(network); if (routingNetwork == null) { routingNetwork = this.routingNetworkFactory.createRoutingNetwork(network); if (this.usePreProcessData) { if (preProcessDijkstra == null) { preProcessDijkstra = new PreProcessDijkstra(); preProcessDijkstra.run(network); this.preProcessData.put(network, preProcessDijkstra); } if (preProcessDijkstra.containsData()) { for (RoutingNetworkNode node : routingNetwork.getNodes().values()) { node.setDeadEndData(preProcessDijkstra.getNodeData(node.getNode())); } } } this.routingNetworks.put(network, routingNetwork); } FastRouterDelegateFactory fastRouterFactory = new ArrayFastRouterDelegateFactory(); return new BackwardFastMultiNodeDijkstra(routingNetwork, travelCosts, travelTimes, preProcessDijkstra, fastRouterFactory, this.searchAllEndNodes); } }