/** * @param network Where we do the routing. * @param preProcessData The pre-process data (containing the landmarks etc.). * @param timeFunction Determines the travel time on each link. * @param costFunction Calculates the travel cost on links. * @param overdoFactor The factor which is multiplied with the output of the A* heuristic function. The higher * the overdo factor the greedier the router, i.e. it visits less nodes during routing and is thus faster, but * for an overdo factor > 1, it is not guaranteed that the router returns the least-cost paths. Rather it tends * to return distance-minimal paths. */ AStarEuclidean(final Network network, final PreProcessEuclidean preProcessData, final TravelDisutility costFunction, final TravelTime timeFunction, final double overdoFactor) { super(network, costFunction, timeFunction, preProcessData); setMinTravelCostPerLength(preProcessData.getMinTravelCostPerLength()); this.overdoFactor = overdoFactor; }