Package org.opentripplanner.routing.algorithm

Interface Summary

Interface	Description
RaptorStateStore	Stores the states used in RAPTOR; allows easily switching to path-reconstructing store, a highly efficient optimal store, or McRAPTOR
TraverseVisitor

Class Summary

Class	Description
AStar	Find the shortest path between graph vertices using A*.
EarliestArrivalSearch	Compute full SPT for earliest arrival problem.
GenericDijkstra	Find the shortest path between graph vertices using Dijkstra's algorithm.
GraphLibrary
PathDiscardingRaptorStateStore

Exception Summary

Exception	Description
NegativeWeightException	This exception is thrown when an edge has a negative weight.