org.opentripplanner.routing.algorithm.strategies.RemainingWeightHeuristic Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of otp Show documentation

The OpenTripPlanner multimodal journey planning system

There is a newer version: 2.6.0

/* This program is free software: you can redistribute it and/or
 modify it under the terms of the GNU Lesser General Public License
 as published by the Free Software Foundation, either version 3 of
 the License, or (props, at your option) any later version.

 This program is distributed in the hope that it will be useful,
 but WITHOUT ANY WARRANTY; without even the implied warranty of
 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 GNU General Public License for more details.

 You should have received a copy of the GNU General Public License
 along with this program.  If not, see . */

package org.opentripplanner.routing.algorithm.strategies;

import java.io.Serializable;

import org.opentripplanner.routing.core.RoutingRequest;
import org.opentripplanner.routing.core.State;
import org.opentripplanner.routing.graph.Vertex;

/**
 * Interface for classes that provides an admissible estimate of (lower bound on) 
 * the weight of a path to the target, starting from a given state.
 */
public interface RemainingWeightHeuristic extends Serializable {
	
    /** 
     * Perform any one-time setup and pre-computation that will be needed by later calls to
     * computeForwardWeight/computeReverseWeight. We may want to start from multiple origin states, so initialization
     * cannot depend on the origin vertex or state.
     * @param abortTime time since the Epoch in milliseconds at which we should bail out of initialization,
     *                  or Long.MAX_VALUE for no limit.
     */
    public void initialize (RoutingRequest options, long abortTime);

    public double estimateRemainingWeight (State s);

    /** Reset any cached data in the heuristic, before reuse in a search with the same destination. */
    public void reset();
    
    /** 
     * Call to cause the heuristic to perform some predetermined amount of work improving its 
     * estimate. Avoids thread synchronization evil by interleaving forward and backward searches. 
     */
    public void doSomeWork();
    
}


// Perhaps directionality should also be defined during the setup,
// instead of having two separate methods for the two directions.
// We might not even need a setup method if the routing options are just passed into the
// constructor.