question: 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 ) ) ; }
target:  Inserts the given Node n into the pendingNodes queue and updates its time and cost information.