Uses of Record Class
rgu.transport.algorithms.search.SpatialTemporalMapping

Packages that use SpatialTemporalMapping

Package	Description
rgu.transport.algorithms.search	Contains algorithms for search such as Dijkstra graph search.

Uses of SpatialTemporalMapping in rgu.transport.algorithms.search

Methods in rgu.transport.algorithms.search that return SpatialTemporalMapping

Modifier and Type	Method	Description
static <V,E> SpatialTemporalMapping<V,E,V>	SpatialTemporalMapping.identity()	Identity function for when the temporal information is not needed.

Methods in rgu.transport.algorithms.search with parameters of type SpatialTemporalMapping

Modifier and Type	Method	Description
<ST,S> List<ST>	Dijkstra.stPath(Explorable<ST,E> graph, ST source, Predicate<ST> target, E maxCost, SpatialTemporalMapping<S,E,ST> stMapping)	Finds a route from the specified source to the specified target(s) by predicate which returns true if a given vertex is a target, within a given maximum cost.
<ST,S> List<ST>	Dijkstra.stPath(Explorable<ST,E> graph, ST source, Predicate<ST> target, SpatialTemporalMapping<S,E,ST> stMapping)	Finds a route from the specified source to the specified target(s) by predicate which returns true if a given vertex is a target.
<ST,S> List<ST>	Dijkstra.stPath(Explorable<ST,E> graph, ST source, ST target, E maxCost, SpatialTemporalMapping<S,E,ST> stMapping)	Finds a route from the specified source to the specified target within a given maximum cost.
<ST,S> List<ST>	Dijkstra.stPath(Explorable<ST,E> graph, ST source, ST target, SpatialTemporalMapping<S,E,ST> stMapping)	Finds a route from the specified source to the specified target.
<ST,S> List<ST>	SpatialTemporalRoutingAlgorithm.stPath(Explorable<ST,E> graph, ST source, Predicate<ST> target, E maxCost, SpatialTemporalMapping<S,E,ST> stMapping)	Finds a route from the specified source to the specified target(s) by predicate which returns true if a given vertex is a target, within a given maximum cost.
<ST,S> List<ST>	SpatialTemporalRoutingAlgorithm.stPath(Explorable<ST,E> graph, ST source, Predicate<ST> target, SpatialTemporalMapping<S,E,ST> stMapping)	Finds a route from the specified source to the specified target(s) by predicate which returns true if a given vertex is a target.
<ST,S> List<ST>	SpatialTemporalRoutingAlgorithm.stPath(Explorable<ST,E> graph, ST source, ST target, E maxCost, SpatialTemporalMapping<S,E,ST> stMapping)	Deprecated, for removal: This API element is subject to removal in a future version.
<ST,S> List<ST>	SpatialTemporalRoutingAlgorithm.stPath(Explorable<ST,E> graph, ST source, ST target, SpatialTemporalMapping<S,E,ST> stMapping)	Deprecated, for removal: This API element is subject to removal in a future version.
<ST,S> void	Dijkstra.stReachable(Explorable<ST,E> graph, ST source, E maxCost, ReachabilityCallback<ST,E> callback, SpatialTemporalMapping<S,E,ST> stMapping)	Streams to a callback function the set of vertices reachable within a given maximum cost, and the corresponding cost of each vertex's shortest path.
<ST,S> Map<ST,E>	Dijkstra.stReachable(Explorable<ST,E> graph, ST source, E maxCost, SpatialTemporalMapping<S,E,ST> stMapping)	Returns the set of vertices reachable within a given maximum cost, and the corresponding cost of each vertex's shortest path.
<ST,S> void	Dijkstra.stReachable(Explorable<ST,E> graph, ST source, ReachabilityCallback<ST,E> callback, SpatialTemporalMapping<S,E,ST> stMapping)	Streams to a callback function the set of reachable vertices and the corresponding cost of each vertex's shortest path.
<ST,S> Map<ST,E>	Dijkstra.stReachable(Explorable<ST,E> graph, ST source, SpatialTemporalMapping<S,E,ST> stMapping)	Returns the set of reachable vertices and the corresponding cost of each vertex's shortest path.
<ST,S> void	SpatialTemporalReachabilityAlgorithm.stReachable(Explorable<ST,E> graph, ST source, E maxCost, ReachabilityCallback<ST,E> callback, SpatialTemporalMapping<S,E,ST> stMapping)	Streams to a callback function the set of vertices reachable within a given maximum cost, and the corresponding cost of each vertex's shortest path.
<ST,S> Map<ST,E>	SpatialTemporalReachabilityAlgorithm.stReachable(Explorable<ST,E> graph, ST source, E maxCost, SpatialTemporalMapping<S,E,ST> stMapping)	Returns the set of vertices reachable within a given maximum cost, and the corresponding cost of each vertex's shortest path.
<ST,S> void	SpatialTemporalReachabilityAlgorithm.stReachable(Explorable<ST,E> graph, ST source, ReachabilityCallback<ST,E> callback, SpatialTemporalMapping<S,E,ST> stMapping)	Streams to a callback function the set of reachable vertices and the corresponding cost of each vertex's shortest path.
<ST,S> Map<ST,E>	SpatialTemporalReachabilityAlgorithm.stReachable(Explorable<ST,E> graph, ST source, SpatialTemporalMapping<S,E,ST> stMapping)	Returns the set of reachable vertices and the corresponding cost of each vertex's shortest path.