All Classes and Interfaces

Class	Description
BinaryMinHeap<E,K>	A minimum heap implemented as a binary heap.
CostMatrix<T,C>	A precomputed cost matrix based on graph reachability search.
DataIO	Methods for custom serialization code.
Dijkstra<E>	A thread-safe and generic implementation of Dijkstra's shortest path algorithm.
Distance	Represents a physical distance.
DurationAdapter	Adapts an instance of Graph<GeoLocation, RoadEdge> to Graph<GeoLocation, Duration> to use with an instance of RoutingAlgorithm<Duration> or ReachabilityAlgorithm<Duration>.
ExhaustiveGeoLocationNearestFinderImpl<D>	Exhaustive search on a set of geo locations.
Explorable<V,E>	An explorable graph-like structure.
GeoLocation	Represents a location on Earth, uniquely defined by latitude and longitude.
GeoLocations	Utility class for working with locations.
Graph<V,E>	A mathematical graph.
Graph.Edge<V,E>	Record type representing an edge with its end points.
GTFSDataSource	An object which provides methods to load input streams of each of the data files in a GTFS data source.
GTFSLoader	Deprecated, for removal: This API element is subject to removal in a future version. Use GTFSParser
GTFSParser	Utility class to load GTFS data files as a TransitNetwork.
GTFSProgressListener	A listener interface for GTFS loading progress.
HashGraph<V,E>	A mathematical graph which uses an underling hashed representation of vertices.
HashGraph.Builder<V,E>	Builder class for HashGraph.
JourneyPosition	A Geolocation and position in a journey.
JourneyState	Represents a state of a journey, as location, time, and vehicle state.
Latitude	Represents a Latitude from -90 degrees (inclusive) to +90 degrees (inclusive) to 7 decimal places.
Longitude	Represents a Longitude from -180 degrees (exclusive) to +180 degrees (inclusive) to 7 decimal places.
Metric<T,D>	A mathematical distance metric between two points.
MinHeap<E,K>	A minimum heap priority queue.
NearestFinder<T>	An object which can be used to find the nearest match within a predetermined set of elements.
NetworkAndRoadJoiner	Used to join a transit network to a road network.
NetworkJoiner	Used to join multiple transit networks to one another, using roads to inform connection times.
NetworkSearcher	Convenience wrapper for reachability searches using Dijkstra.
NoSpeedOSMBuilder
OSMListener
OSMProgressListener
OSMReader	Utility class to read OSM XML files.
PercentSpeedCap	Can apply a speed cap and default speed to a graph.
ProgressListener	Interface for progress bar or other progress display.
Range<T>	A non-empty range in between two values.
ReachabilityAlgorithm<E>	An algorithm which can determine which vertices on an explorable graph are reachable from a source.
ReachabilityCallback<V,E>	A consumer callback for reachability algorithms.
ReachabilityCallback.Action	The result of a callback, instructs the algorithm to either continue or halt.
RelationMember	Represents a relation member in an OSM relation.
RoadEdge
RoutingAlgorithm<E>	An algorithm which can find a route between two vertices on an explorable graph.
SimpleOSMBuilder
SpatialTemporalMapping<S,E,ST>	A mapping between spatial and spatial-temporal representation.
SpatialTemporalReachabilityAlgorithm<E>	An algorithm which can determine which vertices on an explorable spatial-temporal graph are reachable from a source.
SpatialTemporalRoutingAlgorithm<E>	An algorithm which can find a route between two vertices on an explorable spatial-temporal graph.
Speed	A (non-negative) scalar travel speed.
TargetUnreachableException	The specified target cannot be reached from the specified source.
ThreadUtil	Utility class for threading.
Times	Utility class for working with time.
TransitNetwork	A multi-modal transit network.
TransitNetwork.Builder	Builder class, instance is obtained from TransitNetwork.builder().
TravelDirection	Direct of travel, outbound or inbound.
Trip	Represents a trip, specified by departure time, arrival time, and destination, omitting departure location.
TwoDTree<T>	A 2D tree used as a nearest finder with a compatible metric.
TwoDTree.Point	Point usable by the 2D tree.