What follows is relevant for models with time/state dependent transits.
Such transits, say from node A to node B, are functions f: int64->int64 of the cumuls of a dimension. The user is free to implement the abstract RangeIntToIntFunction interface, but it is expected that the implementation of each method is quite fast. For performance-related reasons, StateDependentTransit keeps an additional pointer to a RangeMinMaxIndexFunction, with similar functionality to RangeIntToIntFunction, for g(x) = f(x)+x, where f is the transit from A to B. In most situations the best solutions are problem-specific, but in case of doubt the user may use the MakeStateDependentTransit function from the routing library, which works out-of-the-box, with very good running time, but memory inefficient in some situations.
Definition at line 264 of file routing.h.