Module org.jhotdraw8.graph

Package org.jhotdraw8.graph.path.algo

Interface IndexedVertexReachabilityAlgo<C extends Number & Comparable<C>>

Type Parameters:

C - the cost number type

All Known Implementing Classes:

AnyIndexedVertexReachabilityAlgo

public interface IndexedVertexReachabilityAlgo<C extends Number & Comparable<C>>

Interface for a reachability checker algorithm over a directed graph.

Method Summary

Modifier and Type	Method	Description
boolean	tryToReach(@NonNull Iterable<Integer> startVertices, @NonNull IntPredicate goalPredicate, @NonNull Function<Integer,Spliterator.OfInt> nextVerticesFunction, int maxDepth, @NonNull C zero, @NonNull C costLimit, @NonNull BiFunction<Integer,Integer,C> costFunction, @NonNull BiFunction<C,C,C> sumFunction, @NonNull AddToIntSet visited)	Search engine method.

Method Details

tryToReach

boolean tryToReach(@NonNull Iterable<Integer> startVertices,
 @NonNull IntPredicate goalPredicate,
 @NonNull Function<Integer,Spliterator.OfInt> nextVerticesFunction,
 int maxDepth,
 @NonNull C zero,
 @NonNull C costLimit,
 @NonNull BiFunction<Integer,Integer,C> costFunction,
 @NonNull BiFunction<C,C,C> sumFunction,
 @NonNull AddToIntSet visited)

Search engine method.

Parameters:

startVertices - the set of start vertices

goalPredicate - the goal predicate

nextVerticesFunction - the next vertices function

maxDepth - the maximal depth (inclusive) of the search Must be >= 0.

zero - the zero cost value

costLimit - the algorithm-specific cost limit

costFunction - the cost function

sumFunction - the sum function for adding two cost values

visited - the visited function

Returns:

true on success