Module org.jgrapht.core
Package org.jgrapht.alg.shortestpath
Class ContractionHierarchyBidirectionalDijkstra.ContractionSearchFrontier<V,E>
java.lang.Object
org.jgrapht.alg.shortestpath.BaseBidirectionalShortestPathAlgorithm.BaseSearchFrontier<V,E>
org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath.DijkstraSearchFrontier<V,E>
org.jgrapht.alg.shortestpath.ContractionHierarchyBidirectionalDijkstra.ContractionSearchFrontier<V,E>
- Type Parameters:
V
- vertices typeE
- edges type
- Enclosing class:
ContractionHierarchyBidirectionalDijkstra<V,
E>
static class ContractionHierarchyBidirectionalDijkstra.ContractionSearchFrontier<V,E>
extends BidirectionalDijkstraShortestPath.DijkstraSearchFrontier<V,E>
Maintains search frontier during shortest path computation.
-
Field Summary
FieldsFields inherited from class org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath.DijkstraSearchFrontier
heap, seen
Fields inherited from class org.jgrapht.alg.shortestpath.BaseBidirectionalShortestPathAlgorithm.BaseSearchFrontier
graph
-
Constructor Summary
Constructors -
Method Summary
Methods inherited from class org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath.DijkstraSearchFrontier
getDistance, getTreeEdge, updateDistance
-
Field Details
-
isFinished
boolean isFinished
-
-
Constructor Details
-
ContractionSearchFrontier
ContractionSearchFrontier(Graph<V, E> graph, Supplier<org.jheaps.AddressableHeap<Double, Pair<V, E>>> heapSupplier) Constructs an instance of a search frontier for the given graph, heap supplier andisDownwardEdge
function.- Parameters:
graph
- the graphheapSupplier
- supplier for the preferable heap implementation
-