Package rgu.transport.algorithms.search

package rgu.transport.algorithms.search

Contains algorithms for search such as Dijkstra graph search.

Class	Description
CostMatrix<T,C>	A precomputed cost matrix based on graph reachability search.
Dijkstra<E>	A thread-safe and generic implementation of Dijkstra's shortest path algorithm.
Metric<T, D extends Comparable<? super D>>	A mathematical distance metric between two points.
NearestFinder<T>	An object which can be used to find the nearest match within a predetermined set of elements.
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.
RoutingAlgorithm<E>	An algorithm which can find a route between two vertices on an explorable graph.
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.
TargetUnreachableException	The specified target cannot be reached from the specified source.
ThreadUtil	Utility class for threading.