Uses of Class
org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.ContractionEdge
-
Uses of ContractionHierarchyPrecomputation.ContractionEdge in org.jgrapht.alg.shortestpath
Modifier and TypeMethodDescriptionGraph<ContractionHierarchyPrecomputation.ContractionVertex<V>,
ContractionHierarchyPrecomputation.ContractionEdge<E>> ContractionHierarchyPrecomputation.ContractionHierarchy.getContractionGraph()
Returns contracted graph.Modifier and TypeMethodDescriptionvoid
ContractionHierarchyPrecomputation.ContractionHierarchy.unpackBackward
(ContractionHierarchyPrecomputation.ContractionEdge<E> edge, LinkedList<V> vertexList, LinkedList<E> edgeList) Unpacksedge
by recursively going from target to source.void
ContractionHierarchyPrecomputation.ContractionHierarchy.unpackForward
(ContractionHierarchyPrecomputation.ContractionEdge<E> edge, LinkedList<V> vertexList, LinkedList<E> edgeList) Unpacksedge
by recursively going from source to target.ModifierConstructorDescriptionContractionHierarchyBidirectionalDijkstra
(ContractionHierarchyPrecomputation.ContractionHierarchy<V, E> hierarchy, double radius, Supplier<org.jheaps.AddressableHeap<Double, Pair<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionEdge<E>>>> heapSupplier) Constructs a new instance of the algorithm for the givenhierarchy
,radius
andheapSupplier
.