double function ( final DijkstraNodeData arg0 ) { return arg0 . getCost ( ) ; }
the value used to sort the pending nodes during routing . this implementation compares the total effective travel cost to sort the nodes in the pending nodes queue during routing . 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 revisitNode concode_elem_sep void relaxNode concode_elem_sep int getIterationId concode_elem_sep Path getPath 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