changes the position of the given node n in the pendingnodes queue and updates its time and cost information . concode_field_sep double initialTime concode_elem_sep TransitTravelDisutility costFunction concode_elem_sep HashMap<Id<Node>,DijkstraNodeData> nodeData concode_elem_sep Vehicle vehicle concode_elem_sep CustomDataManager customDataManager concode_elem_sep RouterPriorityQueue<Node> pendingNodes concode_elem_sep double initialCost concode_elem_sep TravelTime timeFunction concode_elem_sep Network network concode_elem_sep Person person concode_elem_sep Map<Node,InitialNode> fromNodes concode_field_sep boolean addToPendingNodes concode_elem_sep RouterPriorityQueue<? extends Node> createRouterPriorityQueue concode_elem_sep void relaxNode concode_elem_sep int getIterationId concode_elem_sep Path getPath concode_elem_sep double getPriority concode_elem_sep void resetNetworkVisited concode_elem_sep void visitNode concode_elem_sep DijkstraNodeData getData concode_elem_sep void expandNodeData concode_elem_sep void relaxNodeLogic
void function ( final Node arg0 , final DijkstraNodeData arg1 , final RouterPriorityQueue < Node > arg2 , final double arg3 , final double arg4 , final Link arg5 ) { arg2 . remove ( arg0 ) ; arg1 . visit ( arg5 , arg4 , arg3 , getIterationId ( ) ) ; arg2 . add ( arg0 , getPriority ( arg1 ) ) ; }