AStarEuclideanFactory.java

Go to the documentation of this file.

/* *********************************************************************** *
 * project: org.matsim.*
 * AStarLandmarksFactory
 *                                                                         *
 * *********************************************************************** *
 *                                                                         *
 * copyright       : (C) 2009 by the members listed in the COPYING,        *
 *                   LICENSE and WARRANTY file.                            *
 * email           : info at matsim dot org                                *
 *                                                                         *
 * *********************************************************************** *
 *                                                                         *
 *   This program is free software; you can redistribute it and/or modify  *
 *   it under the terms of the GNU General Public License as published by  *
 *   the Free Software Foundation; either version 2 of the License, or     *
 *   (at your option) any later version.                                   *
 *   See also COPYING, LICENSE and WARRANTY file                           *
 *                                                                         *
 * *********************************************************************** */
package org.matsim.core.router;

import java.util.HashMap;
import java.util.Map;

import org.matsim.api.core.v01.network.Network;
import org.matsim.core.router.util.LeastCostPathCalculator;
import org.matsim.core.router.util.LeastCostPathCalculatorFactory;
import org.matsim.core.router.util.PreProcessEuclidean;
import org.matsim.core.router.util.TravelDisutility;
import org.matsim.core.router.util.TravelTime;

public class AStarEuclideanFactory implements LeastCostPathCalculatorFactory {

    private final Map<Network, PreProcessEuclidean> preProcessData = new HashMap<>();
    private final double overdoFactor;

    public AStarEuclideanFactory() {
        this(1);
    }

    public AStarEuclideanFactory(double overdoFactor) {
        this.overdoFactor = overdoFactor;
    }

    @Override
    public synchronized LeastCostPathCalculator createPathCalculator(final Network network,
            final TravelDisutility travelCosts, final TravelTime travelTimes) {
        PreProcessEuclidean preProcessEuclidean = this.preProcessData.get(network);
        if (preProcessEuclidean == null) {
            preProcessEuclidean = new PreProcessEuclidean(travelCosts);
            preProcessEuclidean.run(network);
            this.preProcessData.put(network, preProcessEuclidean);
        }

        return new AStarEuclidean(network, preProcessEuclidean, travelCosts, travelTimes, overdoFactor);
    }
}