org.opentripplanner.routing.algorithm

Class PathDiscardingRaptorStateStore

java.lang.Object

org.opentripplanner.routing.algorithm.PathDiscardingRaptorStateStore

All Implemented Interfaces:

RaptorStateStore

public class PathDiscardingRaptorStateStore
extends Object
implements RaptorStateStore

Field Summary

Fields

Modifier and Type	Field and Description
gnu.trove.map.TObjectIntMap<TransitStop>	bestStops The best time to reach each stop in any round by transit only, not by transfer from another stop.
int	maxTime The maximum acceptable clock time in seconds since midnight.

Constructor Summary

Constructors

Constructor and Description
PathDiscardingRaptorStateStore(int rounds) Create a new store with the given number of rounds.
PathDiscardingRaptorStateStore(int rounds, int maxTime)

Method Summary

Modifier and Type	Method and Description
int	getPrev(TransitStop t) get the best time for a given stop after the last round, including transfers
int	getTime(TransitStop t) get the best time for a given stop that was reached by transit (not by transfers)
Collection<TransitStop>	getTouchedStopsIncludingTransfers() get all the stops that were reached in the current round, either via transfers or directly
gnu.trove.iterator.TObjectIntIterator<TransitStop>	iterator() get an iterator over the states of this store
void	proceed() Proceed to the next round
boolean	put(TransitStop t, int time, boolean transfer) Add a state to this store, with the given clock time (seconds since midnight)
void	restart() Restart the search from the first round.

Methods inherited from class java.lang.Object

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

Field Detail

bestStops

public gnu.trove.map.TObjectIntMap<TransitStop> bestStops

The best time to reach each stop in any round by transit only, not by transfer from another stop.

maxTime

public int maxTime

The maximum acceptable clock time in seconds since midnight. All arrivals after this time will be ignored.

Constructor Detail

PathDiscardingRaptorStateStore

public PathDiscardingRaptorStateStore(int rounds)

Create a new store with the given number of rounds. Remember to include the initial walk as a "round"

PathDiscardingRaptorStateStore

public PathDiscardingRaptorStateStore(int rounds,
                                      int maxTime)

Method Detail

put

public boolean put(TransitStop t,
                   int time,
                   boolean transfer)

Description copied from interface: RaptorStateStore

Add a state to this store, with the given clock time (seconds since midnight)

Specified by:

put in interface RaptorStateStore

proceed

public void proceed()

Description copied from interface: RaptorStateStore

Proceed to the next round

Specified by:

proceed in interface RaptorStateStore

getTime

public int getTime(TransitStop t)

Description copied from interface: RaptorStateStore

get the best time for a given stop that was reached by transit (not by transfers)

Specified by:

getTime in interface RaptorStateStore

getPrev

public int getPrev(TransitStop t)

Description copied from interface: RaptorStateStore

get the best time for a given stop after the last round, including transfers

Specified by:

getPrev in interface RaptorStateStore

restart

public void restart()

Restart the search from the first round. Used when running repeated RAPTOR searches using the dynamic programming algorithm. TODO write up the dynamic programming algorithm.

iterator

public gnu.trove.iterator.TObjectIntIterator<TransitStop> iterator()

Description copied from interface: RaptorStateStore

get an iterator over the states of this store

Specified by:

iterator in interface RaptorStateStore

getTouchedStopsIncludingTransfers

public Collection<TransitStop> getTouchedStopsIncludingTransfers()

Description copied from interface: RaptorStateStore

get all the stops that were reached in the current round, either via transfers or directly

Specified by:

getTouchedStopsIncludingTransfers in interface RaptorStateStore