Module org.jgrapht.core
Package org.jgrapht.alg.shortestpath
Class BidirectionalAStarShortestPath.AStarSearchFrontier
java.lang.Object
org.jgrapht.alg.shortestpath.BaseBidirectionalShortestPathAlgorithm.BaseSearchFrontier<V,E>
org.jgrapht.alg.shortestpath.BidirectionalAStarShortestPath.AStarSearchFrontier
- Enclosing class:
BidirectionalAStarShortestPath<V,
E>
class BidirectionalAStarShortestPath.AStarSearchFrontier
extends BaseBidirectionalShortestPathAlgorithm.BaseSearchFrontier<V,E>
Maintains search frontier during shortest path computation.
-
Field Summary
FieldsModifier and TypeFieldDescriptionPredecessor map.Closed nodes of the frontier.(package private) final V
End vertex of the frontier.Tentative distance to the vertices in tha graph computed so far.(package private) final AStarAdmissibleHeuristic
<V> Heuristic used in this frontier.Open nodes of the frontier.Fields inherited from class org.jgrapht.alg.shortestpath.BaseBidirectionalShortestPathAlgorithm.BaseSearchFrontier
graph
-
Constructor Summary
ConstructorsConstructorDescriptionAStarSearchFrontier
(Graph<V, E> graph, V endVertex, AStarAdmissibleHeuristic<V> heuristic) -
Method Summary
Modifier and TypeMethodDescription(package private) double
getDistance
(V v) Returns distance to vertexv
computed so far.(package private) E
getTreeEdge
(V v) Returns edge which connectsv
to its predecessor in the shortest paths tree of this frontier.(package private) void
updateDistance
(V v, E e, double tentativeGScore, double fScore)
-
Field Details
-
endVertex
End vertex of the frontier. -
heuristic
Heuristic used in this frontier. -
openList
Open nodes of the frontier. -
vertexToHeapNodeMap
-
closedList
Closed nodes of the frontier. -
gScoreMap
Tentative distance to the vertices in tha graph computed so far. -
cameFrom
Predecessor map.
-
-
Constructor Details
-
AStarSearchFrontier
-
-
Method Details
-
updateDistance
-
getDistance
Description copied from class:BaseBidirectionalShortestPathAlgorithm.BaseSearchFrontier
Returns distance to vertexv
computed so far.- Specified by:
getDistance
in classBaseBidirectionalShortestPathAlgorithm.BaseSearchFrontier<V,
E> - Parameters:
v
- vertex- Returns:
- distance to
v
-
getTreeEdge
Description copied from class:BaseBidirectionalShortestPathAlgorithm.BaseSearchFrontier
Returns edge which connectsv
to its predecessor in the shortest paths tree of this frontier.- Specified by:
getTreeEdge
in classBaseBidirectionalShortestPathAlgorithm.BaseSearchFrontier<V,
E> - Parameters:
v
- vertex- Returns:
- edge in shortest paths tree
-