@Override protected Path constructPath(Node fromNode, Node toNode, double startTime, double arrivalTime) { return this.fastRouter.constructPath(fromNode, toNode, startTime, arrivalTime); }
@Override protected AStarNodeData getData(final Node n) { return (AStarNodeData) this.fastRouter.getData(n); }
@Override protected PreProcessDijkstra.DeadEndData getPreProcessData(final Node n) { return this.fastRouter.getPreProcessData(n); } }
@Override public Path calcLeastCostPath(final Node fromNode, final Node toNode, final double startTime, final Person person, final Vehicle vehicle) { this.fastRouter.initialize(); this.routingNetwork.initialize(); RoutingNetworkNode routingNetworkFromNode = routingNetwork.getNodes().get(fromNode.getId()); RoutingNetworkNode routingNetworkToNode = routingNetwork.getNodes().get(toNode.getId()); return super.calcLeastCostPath(routingNetworkFromNode, routingNetworkToNode, startTime, person, vehicle); }
@Override protected void relaxNode(final Node outNode, final Node toNode, final RouterPriorityQueue<Node> pendingNodes) { fastRouter.relaxNode(outNode, toNode, pendingNodes); }
@Override public Path calcLeastCostPath(final Node fromNode, final Node toNode, final double startTime, final Person person, final Vehicle vehicle) { this.fastRouter.initialize(); this.routingNetwork.initialize(); RoutingNetworkNode routingNetworkFromNode = this.routingNetwork.getNodes().get(fromNode.getId()); RoutingNetworkNode routingNetworkToNode = this.routingNetwork.getNodes().get(toNode.getId()); return super.calcLeastCostPath(routingNetworkFromNode, routingNetworkToNode, startTime, person, vehicle); }
@Override protected void relaxNode(final Node outNode, final Node toNode, final RouterPriorityQueue<Node> pendingNodes) { this.fastRouter.relaxNode(outNode, toNode, pendingNodes); }
@Override public Path calcLeastCostPath(final Node fromNode, final Node toNode, final double startTime, final Person person, final Vehicle vehicle) { this.fastRouter.initialize(); this.routingNetwork.initialize(); RoutingNetworkNode routingNetworkFromNode = this.routingNetwork.getNodes().get(fromNode.getId()); RoutingNetworkNode routingNetworkToNode = this.routingNetwork.getNodes().get(toNode.getId()); return super.calcLeastCostPath(routingNetworkFromNode, routingNetworkToNode, startTime, person, vehicle); }
@Override protected PreProcessDijkstra.DeadEndData getPreProcessData(final Node n) { return this.fastRouter.getPreProcessData(n); } }
@Override protected void relaxNode(final Node outNode, final Node toNode, final RouterPriorityQueue<Node> pendingNodes) { this.fastRouter.relaxNode(outNode, toNode, pendingNodes); }
@Override protected Path constructPath(Node fromNode, Node toNode, double startTime, double arrivalTime) { return this.fastRouter.constructPath(fromNode, toNode, startTime, arrivalTime); }
@Override protected DijkstraNodeData getData(final Node n) { return (DijkstraNodeData) this.fastRouter.getData(n); }
@Override public Path calcLeastCostPath(final Node fromNode, final Node toNode, final double startTime, final Person person, final Vehicle vehicle) { this.fastRouter.initialize(); this.routingNetwork.initialize(); Node routingNetworkFromNode; Node routingNetworkToNode; if (fromNode instanceof ImaginaryNode) { Collection<? extends InitialNode> initialNodes = ((ImaginaryNode) fromNode).initialNodes; for (InitialNode initialNode : initialNodes) initialNode.node = routingNetwork.getNodes().get(initialNode.node.getId()); routingNetworkFromNode = fromNode; } else routingNetworkFromNode = routingNetwork.getNodes().get(fromNode.getId()); if (toNode instanceof ImaginaryNode) { Collection<? extends InitialNode> initialNodes = ((ImaginaryNode) toNode).initialNodes; for (InitialNode initialNode : initialNodes) initialNode.node = routingNetwork.getNodes().get(initialNode.node.getId()); routingNetworkToNode = toNode; } else routingNetworkToNode = routingNetwork.getNodes().get(toNode.getId()); return super.calcLeastCostPath(routingNetworkFromNode, routingNetworkToNode, startTime, person, vehicle); }
@Override protected PreProcessDijkstra.DeadEndData getPreProcessData(final Node n) { return fastRouter.getPreProcessData(n); } }
@Override protected void relaxNode(final Node outNode, final Node toNode, final RouterPriorityQueue<Node> pendingNodes) { this.controlCounter++; if (this.controlCounter == controlInterval) { int newLandmarkIndex = checkToAddLandmark(outNode, toNode); if (newLandmarkIndex > 0) { updatePendingNodes(newLandmarkIndex, toNode, pendingNodes); } this.controlCounter = 0; } this.fastRouter.relaxNode(outNode, toNode, pendingNodes); }
@Override protected Path constructPath(Node fromNode, Node toNode, double startTime, double arrivalTime) { return this.fastRouter.constructPath(fromNode, toNode, startTime, arrivalTime); }
@Override protected AStarNodeData getData(final Node n) { return (AStarNodeData) this.fastRouter.getData(n); }
@Override protected PreProcessLandmarks.LandmarksData getPreProcessData(final Node n) { return (PreProcessLandmarks.LandmarksData) this.fastRouter.getPreProcessData(n); } }
if (!(toNode instanceof RoutingNetworkNode)) toNode = this.routingNetwork.getNodes().get(toNode.getId()); Path path = this.fastRouter.constructPath(fromNode, toNode, startTime, arrivalTime);
@Override protected DijkstraNodeData getData(final Node n) { return (DijkstraNodeData) fastRouter.getData(n); }