protected void visitNode(final Node n,final DijkstraNodeData data,final PseudoRemovePriorityQueue<Node> pendingNodes,final double time,final double cost,final Link outLink,int itID){
  data.visit(outLink,cost,time,itID);
  pendingNodes.add(n,getPriority(data));
}

protected void visitNode ( final Node n , final DijkstraNodeData data , final PseudoRemovePriorityQueue < Node > pendingNodes , final double time , final double cost , final Link outLink , int itID ) { data . visit ( outLink , cost , time , itID ) ; pendingNodes . add ( n , getPriority ( data ) ) ; }
inserts the given node n into the pendingnodes queue and updates its time and cost information .
