Uses of Class
org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.ContractionHierarchy

Packages that use ContractionHierarchyPrecomputation.ContractionHierarchy

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

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

Methods in org.jgrapht.alg.shortestpath that return ContractionHierarchyPrecomputation.ContractionHierarchy

Modifier and Type	Method	Description
ContractionHierarchyPrecomputation.ContractionHierarchy<V,E>	ContractionHierarchyPrecomputation.computeContractionHierarchy()	Computes contraction hierarchy for graph.

Constructors in org.jgrapht.alg.shortestpath with parameters of type ContractionHierarchyPrecomputation.ContractionHierarchy

Constructor	Description
CHManyToManyShortestPaths(ContractionHierarchyPrecomputation.ContractionHierarchy<V,E> contractionHierarchy)	Constructs an instance of the algorithm for a given contractionHierarchy.
ContractionHierarchyBidirectionalDijkstra(ContractionHierarchyPrecomputation.ContractionHierarchy<V,E> hierarchy)	Constructs a new instance of the algorithm for a given hierarchy.
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.