Uses of Class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.ContractionEdge (JGraphT : a free Java graph library)

Packages that use ContractionHierarchyPrecomputation.ContractionEdge
Package Description

org.jgrapht.alg.shortestpath
Shortest-path related algorithms.

Uses of ContractionHierarchyPrecomputation.ContractionEdge in org.jgrapht.alg.shortestpath

Methods in org.jgrapht.alg.shortestpath that return types with arguments of type ContractionHierarchyPrecomputation.ContractionEdge
Modifier and Type	Method	Description
`Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>,ContractionHierarchyPrecomputation.ContractionEdge<E>>`	ContractionHierarchyPrecomputation.ContractionHierarchy.`getContractionGraph()`	Returns contracted graph.

Methods in org.jgrapht.alg.shortestpath with parameters of type ContractionHierarchyPrecomputation.ContractionEdge
Modifier and Type	Method	Description
`void`	ContractionHierarchyPrecomputation.ContractionHierarchy.`unpackBackward(ContractionHierarchyPrecomputation.ContractionEdge<E> edge, LinkedList<V> vertexList, LinkedList<E> edgeList)`	Unpacks `edge` by recursively going from target to source.
`void`	ContractionHierarchyPrecomputation.ContractionHierarchy.`unpackForward(ContractionHierarchyPrecomputation.ContractionEdge<E> edge, LinkedList<V> vertexList, LinkedList<E> edgeList)`	Unpacks `edge` by recursively going from source to target.

Constructor parameters in org.jgrapht.alg.shortestpath with type arguments of type ContractionHierarchyPrecomputation.ContractionEdge
Constructor	Description
`ContractionHierarchyBidirectionalDijkstra(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 given `hierarchy`, `radius` and `heapSupplier`.