Module org.jgrapht.core
Package org.jgrapht.alg.shortestpath
Class BidirectionalAStarShortestPath.TerminationCriterion
java.lang.Object
org.jgrapht.alg.shortestpath.BidirectionalAStarShortestPath.TerminationCriterion
- Direct Known Subclasses:
BidirectionalAStarShortestPath.ConsistentTerminationCriterion
,BidirectionalAStarShortestPath.InconsistentTerminationCriterion
- Enclosing class:
BidirectionalAStarShortestPath<V,
E>
Termination criterion for the heuristic search.
-
Field Summary
FieldsModifier and TypeFieldDescription(package private) final BidirectionalAStarShortestPath<V,
E>.AStarSearchFrontier (package private) final BidirectionalAStarShortestPath<V,
E>.AStarSearchFrontier -
Constructor Summary
ConstructorsConstructorDescriptionTerminationCriterion
(BidirectionalAStarShortestPath<V, E>.AStarSearchFrontier forward, BidirectionalAStarShortestPath<V, E>.AStarSearchFrontier backward) -
Method Summary
Modifier and TypeMethodDescription(package private) abstract boolean
stop
(double bestPath) Determines if the search should be terminated.
-
Field Details
-
forward
-
backward
-
-
Constructor Details
-
TerminationCriterion
TerminationCriterion(BidirectionalAStarShortestPath<V, E>.AStarSearchFrontier forward, BidirectionalAStarShortestPath<V, E>.AStarSearchFrontier backward)
-
-
Method Details
-
stop
abstract boolean stop(double bestPath) Determines if the search should be terminated.- Parameters:
bestPath
- length of the shortest path seen so far- Returns:
- true iff the search should be terminated
-