Module org.jhotdraw8.graph

Package org.jhotdraw8.graph.path.algo

Interface VertexPathSearchAlgo<V,C extends Number & Comparable<C>>

Type Parameters:

V - the vertex data type

C - the cost number type

All Known Implementing Classes:

AnyShortestVertexPathSearchAlgo, AnyVertexPathSearchAlgo, UniqueOnAcyclicGraphVertexPathSearchAlgo, UniqueOrOneHopVertexPathSearchAlgo, UniqueShortestVertexPathSearchAlgo, UniqueVertexPathSearchAlgo

public interface VertexPathSearchAlgo<V,C extends Number & Comparable<C>>

Interface for a vertex path search algorithm.

Method Summary

Modifier and Type	Method	Description
@Nullable VertexBackLinkWithCost<V,C>	search(@NonNull Iterable<V> startVertices, @NonNull Predicate<V> goalPredicate, @NonNull Function<V,Iterable<V>> nextVerticesFunction, int maxDepth, @NonNull C zero, @NonNull C costLimit, @NonNull BiFunction<V,V,C> costFunction, @NonNull BiFunction<C,C,C> sumFunction, @NonNull AddToSet<V> visited)	Search engine method.

Method Details

search

@Nullable VertexBackLinkWithCost<V,C> search(@NonNull Iterable<V> startVertices,
 @NonNull Predicate<V> goalPredicate,
 @NonNull Function<V,Iterable<V>> nextVerticesFunction,
 int maxDepth,
 @NonNull C zero,
 @NonNull C costLimit,
 @NonNull BiFunction<V,V,C> costFunction,
 @NonNull BiFunction<C,C,C> sumFunction,
 @NonNull AddToSet<V> 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

sumFunction - the sum function for adding two cost values

visited - the visited function

Returns:

on success: a back link, otherwise: null