static <N,E> Iterable<Path<N,E>> |
ShortestPaths.shortestPaths(IndefiniteGraph<N,E> graph,
Collection<? extends N> start,
int limit,
Collection<?> targets) |
Returns a collection of shortest paths from the start nodes to the target nodes, if available.
|
static <N,E> Iterable<Path<N,E>> |
ShortestPaths.shortestPaths(IndefiniteGraph<N,E> graph,
Collection<? extends N> start,
int limit,
Predicate<? super N> pred) |
Returns a collection of shortest paths from the start nodes to all nodes that satisfy the given predicate, if
available.
|
static <N,E> Iterable<Path<N,E>> |
ShortestPaths.shortestPaths(IndefiniteGraph<N,E> graph,
Collection<? extends N> start,
int limit,
N target) |
Returns a collection of shortest paths from the start nodes to the target node, if available.
|
static <N,E> Iterable<Path<N,E>> |
ShortestPaths.shortestPaths(IndefiniteGraph<N,E> graph,
N start,
int limit,
Collection<?> targets) |
Returns a collection of shortest paths from the start node to the target nodes, if available.
|
static <N,E> Iterable<Path<N,E>> |
ShortestPaths.shortestPaths(IndefiniteGraph<N,E> graph,
N start,
int limit,
Predicate<? super N> pred) |
Returns a collection of shortest paths from the start node to all nodes that satisfy the given predicate, if
available.
|
static <N,E> Iterator<Path<N,E>> |
ShortestPaths.shortestPathsIterator(IndefiniteGraph<N,E> graph,
Collection<? extends N> start,
int limit,
Predicate<? super N> pred) |
Returns an iterator of shortest paths from the start nodes to all nodes that satisfy the given predicate, if
available.
|