Module org.jhotdraw8.graph

Package org.jhotdraw8.graph.path

Interface AllArrowsSequencesFinder<V,A,C extends Number & Comparable<C>>

Type Parameters:

V - the vertex data type

A - the arrow data type

C - the cost number type

All Known Subinterfaces:

CombinedAllSequencesFinder<V,A,C>

All Known Implementing Classes:

SimpleCombinedAllSequencesFinder

public interface AllArrowsSequencesFinder<V,A,C extends Number & Comparable<C>>

Interface for finding all sequences between a set of source vertices and goal vertices up to a maximal depth in a directed graph.

Method Summary

Modifier and Type	Method	Description
@NonNull Iterable<OrderedPair<ImmutableList<A>,C>>	findAllArrowSequences(@NonNull Iterable<V> startVertices, @NonNull Predicate<V> goalPredicate, int maxDepth, @NonNull C costLimit)	Finds all arrow paths up to (including) the specified maximal cost.

Method Details

findAllArrowSequences

@NonNull Iterable<OrderedPair<ImmutableList<A>,C>> findAllArrowSequences(@NonNull Iterable<V> startVertices,
 @NonNull Predicate<V> goalPredicate,
 int maxDepth,
 @NonNull C costLimit)

Finds all arrow paths up to (including) the specified maximal cost.

Parameters:

startVertices - the set of start vertices

goalPredicate - the goal predicate

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

costLimit - the algorithm-specific cost limit

Returns:

all paths