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

Packages that use ReachabilityAlgorithm

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

Uses of ReachabilityAlgorithm in rgu.transport.algorithms.search

Classes in rgu.transport.algorithms.search that implement ReachabilityAlgorithm

Modifier and Type	Class	Description
final class	Dijkstra<E>	A thread-safe and generic implementation of Dijkstra's shortest path algorithm.

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

Modifier and Type	Method	Description
static <T,C> CostMatrix<T,C>	CostMatrix.construct(Explorable<T,C> graph, Set<T> vertices, ReachabilityAlgorithm<C> algorithm)	Constructs a cost matrix by searching the specified graph.
static <T,C> CostMatrix<T,C>	CostMatrix.construct(Explorable<T,C> graph, Set<T> vertices, ReachabilityAlgorithm<C> algorithm, ProgressListener progress)	Constructs a cost matrix by searching the specified graph.
static <T,C> CostMatrix<T,C>	CostMatrix.construct(Explorable<T,C> graph, Set<T> vertices, ReachabilityAlgorithm<C> algorithm, ProgressListener progress, boolean subStageOnly)	Constructs a cost matrix by searching the specified graph.