Module org.jgrapht.core
Package org.jgrapht.alg.shortestpath
Class BidirectionalDijkstraShortestPath.DijkstraSearchFrontier<V,E>
java.lang.Object
org.jgrapht.alg.shortestpath.BaseBidirectionalShortestPathAlgorithm.BaseSearchFrontier<V,E>
org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath.DijkstraSearchFrontier<V,E>
- Type Parameters:
V
- vertices typeE
- edges type
- Direct Known Subclasses:
ContractionHierarchyBidirectionalDijkstra.ContractionSearchFrontier
- Enclosing class:
BidirectionalDijkstraShortestPath<V,
E>
static class BidirectionalDijkstraShortestPath.DijkstraSearchFrontier<V,E>
extends BaseBidirectionalShortestPathAlgorithm.BaseSearchFrontier<V,E>
Maintains search frontier during shortest path computation.
-
Field Summary
FieldsModifier and TypeFieldDescriptionFields inherited from class org.jgrapht.alg.shortestpath.BaseBidirectionalShortestPathAlgorithm.BaseSearchFrontier
graph
-
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptiondouble
getDistance
(V v) Returns distance to vertexv
computed so far.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 distance)
-
Field Details
-
heap
-
seen
-
-
Constructor Details
-
DijkstraSearchFrontier
-
-
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
-