@ParametersAreNonnullByDefault public final class ShortestPaths extends Object
This class offers an iterator-style approach to shortest path search: the methods in this class generally return
either an Iterator
or an Iterable
wrapped around an iterator which allows for enumerating all
shortest paths to the given set of target nodes. The iterators implement this lazily, i.e., a call to the next()
method of an iterator will continue the shortest path search on an as-needed basis.
Modifier and Type | Method and Description |
---|---|
static <N,E> Path<N,E> |
shortestPath(IndefiniteGraph<N,E> graph,
Collection<? extends N> start,
int limit,
Collection<?> targets) |
static <N,E> Path<N,E> |
shortestPath(IndefiniteGraph<N,E> graph,
Collection<? extends N> start,
int limit,
N target) |
static <N,E> Path<N,E> |
shortestPath(IndefiniteGraph<N,E> graph,
Collection<? extends N> start,
int limit,
Predicate<? super N> targetPred) |
static <N,E> Path<N,E> |
shortestPath(IndefiniteGraph<N,E> graph,
N start,
int limit,
Collection<?> targets) |
static <N,E> Path<N,E> |
shortestPath(IndefiniteGraph<N,E> graph,
N start,
int limit,
N target) |
static <N,E> Path<N,E> |
shortestPath(IndefiniteGraph<N,E> graph,
N start,
int limit,
Predicate<? super N> targetPred) |
static <N,E> Iterable<Path<N,E>> |
shortestPaths(IndefiniteGraph<N,E> graph,
Collection<? extends N> start,
int limit,
Collection<?> targets) |
static <N,E> Iterable<Path<N,E>> |
shortestPaths(IndefiniteGraph<N,E> graph,
Collection<? extends N> start,
int limit,
N target) |
static <N,E> Iterable<Path<N,E>> |
shortestPaths(IndefiniteGraph<N,E> graph,
Collection<? extends N> start,
int limit,
Predicate<? super N> targetPred) |
static <N,E> Iterable<Path<N,E>> |
shortestPaths(IndefiniteGraph<N,E> graph,
N start,
int limit,
Collection<?> targets) |
static <N,E> Iterable<Path<N,E>> |
shortestPaths(IndefiniteGraph<N,E> graph,
N start,
int limit,
N target) |
static <N,E> Iterable<Path<N,E>> |
shortestPaths(IndefiniteGraph<N,E> graph,
N start,
int limit,
Predicate<? super N> targetPred) |
static <N,E> Iterator<Path<N,E>> |
shortestPathsIterator(IndefiniteGraph<N,E> graph,
Collection<? extends N> start,
int limit,
Predicate<? super N> targetPred) |
public static <N,E> Iterable<Path<N,E>> shortestPaths(IndefiniteGraph<N,E> graph, @Nullable N start, int limit, N target)
public static <N,E> Iterable<Path<N,E>> shortestPaths(IndefiniteGraph<N,E> graph, @Nullable N start, int limit, Predicate<? super N> targetPred)
public static <N,E> Iterable<Path<N,E>> shortestPaths(IndefiniteGraph<N,E> graph, Collection<? extends N> start, int limit, Predicate<? super N> targetPred)
public static <N,E> Iterable<Path<N,E>> shortestPaths(IndefiniteGraph<N,E> graph, @Nullable N start, int limit, Collection<?> targets)
public static <N,E> Iterable<Path<N,E>> shortestPaths(IndefiniteGraph<N,E> graph, Collection<? extends N> start, int limit, @Nullable N target)
public static <N,E> Iterable<Path<N,E>> shortestPaths(IndefiniteGraph<N,E> graph, Collection<? extends N> start, int limit, Collection<?> targets)
public static <N,E> Path<N,E> shortestPath(IndefiniteGraph<N,E> graph, @Nullable N start, int limit, Collection<?> targets)
public static <N,E> Path<N,E> shortestPath(IndefiniteGraph<N,E> graph, @Nullable N start, int limit, Predicate<? super N> targetPred)
public static <N,E> Path<N,E> shortestPath(IndefiniteGraph<N,E> graph, Collection<? extends N> start, int limit, Predicate<? super N> targetPred)
public static <N,E> Path<N,E> shortestPath(IndefiniteGraph<N,E> graph, @Nullable N start, int limit, @Nullable N target)
public static <N,E> Path<N,E> shortestPath(IndefiniteGraph<N,E> graph, Collection<? extends N> start, int limit, Collection<?> targets)
public static <N,E> Path<N,E> shortestPath(IndefiniteGraph<N,E> graph, Collection<? extends N> start, int limit, @Nullable N target)
public static <N,E> Iterator<Path<N,E>> shortestPathsIterator(IndefiniteGraph<N,E> graph, Collection<? extends N> start, int limit, Predicate<? super N> targetPred)
Copyright © 2018. All rights reserved.