Module org.jhotdraw8.graph
Package org.jhotdraw8.graph.path

Interface AllVertexSequencesFinder<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 AllVertexSequencesFinder<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 and a maximal cost in a directed graph.

  • Method Details

    • findAllVertexSequences

      @NonNull Iterable<OrderedPair<ImmutableList<V>,C>> findAllVertexSequences(@NonNull Iterable<V> startVertices, @NonNull Predicate<V> goalPredicate, int maxDepth, @NonNull C costLimit)
      Finds all vertex 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 search limit
      Returns:
      all paths