@Override protected void visitNode(final Node n, final DijkstraNodeData data, final RouterPriorityQueue<Node> pendingNodes, final double time, final double cost, final Link outLink) { data.visit(outLink, cost, time, this.iterationID); //if (outLink != null) log.info("OutLink: " + outLink.getId()+ " Node " + n.getId() + " costs " + cost + " time " + time/60.0); pendingNodes.add(n, getPriority(data)); }
/** * Inserts the given Node n into the pendingNodes queue and updates its time * and cost information. * * @param n * The Node that is revisited. * @param data * The data for n. * @param pendingNodes * The nodes visited and not processed yet. * @param time * The time of the visit of n. * @param cost * The accumulated cost at the time of the visit of n. * @param outLink * The node from which we came visiting n. */ protected void visitNode(final Node n, final DijkstraNodeData data, final RouterPriorityQueue<Node> pendingNodes, final double time, final double cost, final Link outLink) { data.visit(outLink, cost, time, getIterationId()); pendingNodes.add(n, getPriority(data)); }
/** * Inserts the given Node n into the pendingNodes queue and updates its time * and cost information. * * @param n * The Node that is revisited. * @param data * The data for n. * @param pendingNodes * The nodes visited and not processed yet. * @param time * The time of the visit of n. * @param cost * The accumulated cost at the time of the visit of n. * @param outLink * The node from which we came visiting n. */ protected void visitNode(final Node n, final DijkstraNodeData data, final RouterPriorityQueue<Node> pendingNodes, final double time, final double cost, final Link outLink) { data.visit(outLink, cost, time, getIterationId()); pendingNodes.add(n, getPriority(data)); }
/** * Inserts the given Node n into the pendingNodes queue and updates its time * and cost information. * * @param n * The Node that is revisited. * @param data * The data for n. * @param pendingNodes * The nodes visited and not processed yet. * @param time * The time of the visit of n. * @param cost * The accumulated cost at the time of the visit of n. * @param outLink * The node from which we came visiting n. */ protected void visitNode(final Node n, final DijkstraNodeData data, final PseudoRemovePriorityQueue<Node> pendingNodes, final double time, final double cost, final Link outLink) { data.visit(outLink, cost, time, getIterationId()); pendingNodes.add(n, getPriority(data)); }
/** * Changes the position of the given Node n in the pendingNodes queue and * updates its time and cost information. * * @param n * The Node that is revisited. * @param data * The data for n. * @param pendingNodes * The nodes visited and not processed yet. * @param time * The time of the visit of n. * @param cost * The accumulated cost at the time of the visit of n. * @param outLink * The link from which we came visiting n. */ protected void revisitNode(final Node n, final DijkstraNodeData data, final RouterPriorityQueue<Node> pendingNodes, final double time, final double cost, final Link outLink) { data.visit(outLink, cost, time, getIterationId()); pendingNodes.decreaseKey(n, getPriority(data)); }
/** * Changes the position of the given Node n in the pendingNodes queue and * updates its time and cost information. * * @param n * The Node that is revisited. * @param data * The data for n. * @param pendingNodes * The nodes visited and not processed yet. * @param time * The time of the visit of n. * @param cost * The accumulated cost at the time of the visit of n. * @param outLink * The link from which we came visiting n. */ void revisitNode(final Node n, final DijkstraNodeData data, final RouterPriorityQueue<Node> pendingNodes, final double time, final double cost, final Link outLink) { pendingNodes.remove(n); data.visit(outLink, cost, time, getIterationId()); pendingNodes.add(n, getPriority(data)); }
/** * Changes the position of the given Node n in the pendingNodes queue and * updates its time and cost information. * * @param n * The Node that is revisited. * @param data * The data for n. * @param pendingNodes * The nodes visited and not processed yet. * @param time * The time of the visit of n. * @param cost * The accumulated cost at the time of the visit of n. * @param outLink * The link from which we came visiting n. */ void revisitNode(final Node n, final DijkstraNodeData data, final PseudoRemovePriorityQueue<Node> pendingNodes, final double time, final double cost, final Link outLink) { pendingNodes.remove(n); data.visit(outLink, cost, time, getIterationId()); pendingNodes.add(n, getPriority(data)); }
data.visit(l, totalCost, currTime + travelTime, this.iterationID); pendingNodes.add(n, getPriority(data));