Uses of Interface
rgu.transport.algorithms.search.ReachabilityCallback

Packages that use ReachabilityCallback

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

Uses of ReachabilityCallback in rgu.transport.algorithms.search

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

Modifier and Type	Method	Description
static <V,E> ReachabilityCallback<V,E>	ReachabilityCallback.from(BiConsumer<V,E> consumer)	Converts a bi-consumer to a reachability callback which never halts early.
static <V,E> ReachabilityCallback<V,E>	ReachabilityCallback.from(BiConsumer<V,E> consumer, BiPredicate<V,E> shouldHalt)	Converts a bi-consumer to a reachability callback which halts early based on a separate call to a bi-predicate, where true indicates halt.

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

Modifier and Type	Method	Description
<V> void	Dijkstra.reachable(Explorable<V,E> graph, V source, E maxCost, ReachabilityCallback<V,E> callback)	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.
<V> void	Dijkstra.reachable(Explorable<V,E> graph, V source, ReachabilityCallback<V,E> callback)	Streams to a callback function the set of reachable vertices and the corresponding cost of each vertex's shortest path.
<V> void	ReachabilityAlgorithm.reachable(Explorable<V,E> graph, V source, E maxCost, ReachabilityCallback<V,E> callback)	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.
<V> void	ReachabilityAlgorithm.reachable(Explorable<V,E> graph, V source, ReachabilityCallback<V,E> callback)	Streams to a callback function the set of reachable vertices and the corresponding cost of each vertex's shortest path.
<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> 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> 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> 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.