org.opentripplanner.routing.algorithm

Class EarliestArrivalSearch

java.lang.Object

org.opentripplanner.routing.algorithm.EarliestArrivalSearch

public class EarliestArrivalSearch
extends Object

Compute full SPT for earliest arrival problem. Always builds a full shortest path tree ("batch mode"). Note that walk limiting must be turned off -- resource limiting is not algorithmically correct. TODO this implements the deprecated SPTService interface. It should become a different SPT and dominance function implementation, rather than a "service"

Field Summary

Fields

Modifier and Type	Field and Description
int	maxDuration

Constructor Summary

Constructors

Constructor and Description
EarliestArrivalSearch()

Method Summary

Modifier and Type	Method and Description
ShortestPathTree	getShortestPathTree(RoutingRequest req)
ShortestPathTree	getShortestPathTree(RoutingRequest req, double timeoutSeconds)
ShortestPathTree	getShortestPathTree(RoutingRequest options, double relTimeout, SearchTerminationStrategy terminationStrategy)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

maxDuration

public int maxDuration

Constructor Detail

EarliestArrivalSearch

public EarliestArrivalSearch()

Method Detail

getShortestPathTree

public ShortestPathTree getShortestPathTree(RoutingRequest req)

getShortestPathTree

public ShortestPathTree getShortestPathTree(RoutingRequest req,
                                            double timeoutSeconds)

getShortestPathTree

public ShortestPathTree getShortestPathTree(RoutingRequest options,
                                            double relTimeout,
                                            SearchTerminationStrategy terminationStrategy)