Uses of Class
rgu.transport.algorithms.search.TargetUnreachableException

Packages that use TargetUnreachableException

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

Uses of TargetUnreachableException in rgu.transport.algorithms.search

Methods in rgu.transport.algorithms.search that throw TargetUnreachableException

Modifier and Type	Method	Description
C	CostMatrix.cost(T source, T target)	Returns the cost from the specified source to the specified target.
<V> List<V>	Dijkstra.path(Explorable<V,E> graph, V source, Predicate<V> target)	Finds a route from the specified source to the specified target(s) by predicate which returns true if a given vertex is a target.
<V> List<V>	Dijkstra.path(Explorable<V,E> graph, V source, Predicate<V> target, E maxCost)	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.
<V> List<V>	Dijkstra.path(Explorable<V,E> graph, V source, V target)	Finds a route from the specified source to the specified target.
<V> List<V>	Dijkstra.path(Explorable<V,E> graph, V source, V target, E maxCost)	Finds a route from the specified source to the specified target within a given maximum cost.
<V> List<V>	RoutingAlgorithm.path(Explorable<V,E> graph, V source, Predicate<V> target)	Finds a route from the specified source to the specified target(s) by predicate which returns true if a given vertex is a target.
<V> List<V>	RoutingAlgorithm.path(Explorable<V,E> graph, V source, Predicate<V> target, E maxCost)	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.
<V> List<V>	RoutingAlgorithm.path(Explorable<V,E> graph, V source, V target)	Finds a route from the specified source to the specified target.
<V> List<V>	RoutingAlgorithm.path(Explorable<V,E> graph, V source, V target, E maxCost)	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, 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.