org.jhotdraw8.graph.path.algo.AnyShortestArcPathSearchAlgo<V,A,C>

Type Parameters:: V - the vertex data type; A - the arrow data type; C - the cost number type

public class AnyShortestArcPathSearchAlgo<V,A,C extends Number & Comparable<C>> extends Object implements ArcPathSearchAlgo<V,A,C>

Searches an arbitrary shortest path from a set of start vertices to a set of goal vertices using Dijkstra's algorithm.

The provided cost function must return values >= 0 for all arrows.

Performance characteristics:

When the algorithm returns a back link: less or equal O( (|A| + |V|)*log|V| ) within max cost
When the algorithm returns null: exactly O( (|A| + |V|)*log|V| ) within max cost

References:

Edsger W. Dijkstra (1959): A note on two problems in connexion with graphs, Problem 2. tum.de

Constructor Details
- AnyShortestArcPathSearchAlgo
  
  public AnyShortestArcPathSearchAlgo()
Method Details
- search
  
  public @Nullable ArcBackLinkWithCost<V,A,C> search(@NonNull Iterable<V> startVertices, @NonNull Predicate<V> goalPredicate, @NonNull Function<V,Iterable<Arc<V,A>>> nextArcsFunction, int maxDepth, @NonNull C zero, @NonNull C costLimit, @NonNull Function3<V,V,A,C> costFunction, @NonNull BiFunction<C,C,C> sumFunction, @NonNull AddToSet<V> visited)
  
  Search engine method.
  
  Specified by:
  
  search in interface ArcPathSearchAlgo<V,A,C extends Number & Comparable<C>>
  
  Parameters:
  
  startVertices - the set of start vertices
  
  goalPredicate - the goal predicate
  
  nextArcsFunction - the next arcs function
  
  maxDepth - the maximal depth (inclusive) of the search Must be >= 0.
  
  zero - the zero cost value
  
  costLimit - the maximal cost (inclusive) of a path. Must be >= zero.
  
  costFunction - the cost function
  
  sumFunction - the sum function for adding two cost values
  
  visited -
  
  Returns:
  
  on success: a back link, otherwise: null

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

Constructor Summary