Module org.jhotdraw8.graph

Package org.jhotdraw8.graph.path

Class SimpleCombinedAllSequencesFinder<V,A,C extends Number & Comparable<C>>

java.lang.Object

org.jhotdraw8.graph.path.SimpleCombinedAllSequencesFinder<V,A,C>

Type Parameters:

V - the vertex data type

A - the arrow data type

C - the cost number type

All Implemented Interfaces:

AllArcSequencesFinder<V,A,C>, AllArrowsSequencesFinder<V,A,C>, AllVertexSequencesFinder<V,A,C>, CombinedAllSequencesFinder<V,A,C>

public class SimpleCombinedAllSequencesFinder<V,A,C extends Number & Comparable<C>>
extends Object
implements CombinedAllSequencesFinder<V,A,C>

Implements the CombinedAllSequencesFinder interface.

See AllWalksSpliterator for a description of the underlying algorithm.

Constructor Summary

Constructors

Constructor	Description
SimpleCombinedAllSequencesFinder(@NonNull Function<V,Iterable<Arc<V,A>>> nextArcsFunction, @NonNull C zero, @NonNull Function3<V,V,A,C> costFunction, @NonNull BiFunction<C,C,C> sumFunction)	Creates a new instance.

Method Summary

Modifier and Type	Method	Description
@NonNull Iterable<OrderedPair<ImmutableList<Arc<V,A>>,C>>	findAllArcSequences(@NonNull Iterable<V> startVertices, @NonNull Predicate<V> goalPredicate, int maxDepth, @NonNull C costLimit)	Finds all arc paths up to (including) the specified maximal cost.
@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.
@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.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

SimpleCombinedAllSequencesFinder

public SimpleCombinedAllSequencesFinder(@NonNull Function<V,Iterable<Arc<V,A>>> nextArcsFunction,
 @NonNull C zero,
 @NonNull Function3<V,V,A,C> costFunction,
 @NonNull BiFunction<C,C,C> sumFunction)

Creates a new instance.

Parameters:

nextArcsFunction - the next arcs function

zero - the zero cost value

costFunction - the cost function

sumFunction - the sum function

Method Details

findAllArcSequences

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

Description copied from interface: AllArcSequencesFinder

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

Specified by:

findAllArcSequences in interface AllArcSequencesFinder<V,A,C extends Number & Comparable<C>>

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

findAllArrowSequences

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

Description copied from interface: AllArrowsSequencesFinder

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

Specified by:

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

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

findAllVertexSequences

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

Description copied from interface: AllVertexSequencesFinder

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

Specified by:

findAllVertexSequences in interface AllVertexSequencesFinder<V,A,C extends Number & Comparable<C>>

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