Package com.graphhopper.routing.weighting
package com.graphhopper.routing.weighting
-
ClassDescriptionThe AdjustedWeighting wraps another Weighting.Increases the weight for a certain set of edges by a given factor and thus makes them less likely to be part of a shortest pathTurns an unidirectional weight Approximation into a bidirectional balanced one.Approximates the distance to the goal node by weighting the beeline distance according to the distance weightingCalculates the fastest route with the specified vehicle (VehicleEncoder).Whenever a
QueryGraph
is used for shortest path calculations including turn costs we need to wrap theWeighting
we want to use with this class.Calculates the shortest route - independent of a vehicle as the calculation is based on the distance only.Implementations of this interface define how turn costs and turn times are calculated.Specifies a weight approximation between an node and the goalNode according to the specified weighting.Specifies how the best route is calculated.