Uses of Class
org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.ContractionHierarchy
Packages that use ContractionHierarchyPrecomputation.ContractionHierarchy
-
Uses of ContractionHierarchyPrecomputation.ContractionHierarchy in org.jgrapht.alg.shortestpath
Fields in org.jgrapht.alg.shortestpath declared as ContractionHierarchyPrecomputation.ContractionHierarchyModifier and TypeFieldDescriptionCHManyToManyShortestPaths.contractionHierarchy
Contraction hierarchy ofgraph
.ContractionHierarchyBidirectionalDijkstra.contractionHierarchy
Contraction hierarchy which is used to compute shortest paths.TransitNodeRoutingPrecomputation.contractionHierarchy
Contraction hierarchy which is used to compute transit node routing.TransitNodeRoutingPrecomputation.TransitNodeRouting.contractionHierarchy
Contraction hierarchy based on which this transit node routing was computed.TransitNodeRoutingShortestPath.contractionHierarchy
Contraction hierarchy which is used to compute shortest paths.Methods in org.jgrapht.alg.shortestpath that return ContractionHierarchyPrecomputation.ContractionHierarchyModifier and TypeMethodDescriptionContractionHierarchyPrecomputation.computeContractionHierarchy()
Computes contraction hierarchy forgraph
.TransitNodeRoutingPrecomputation.TransitNodeRouting.getContractionHierarchy()
Returns contraction hierarchy of this transit node routing.Constructors in org.jgrapht.alg.shortestpath with parameters of type ContractionHierarchyPrecomputation.ContractionHierarchyModifierConstructorDescriptionCHManyToManyShortestPaths
(ContractionHierarchyPrecomputation.ContractionHierarchy<V, E> contractionHierarchy) Constructs an instance of the algorithm for a givencontractionHierarchy
.CHManyToManyShortestPathsImpl
(Graph<V, E> graph, ContractionHierarchyPrecomputation.ContractionHierarchy<V, E> hierarchy, Set<V> sources, Set<V> targets, Map<ContractionHierarchyPrecomputation.ContractionVertex<V>, Map<ContractionHierarchyPrecomputation.ContractionVertex<V>, Pair<Double, ContractionHierarchyPrecomputation.ContractionEdge<E>>>> forwardSearchSpaces, Map<ContractionHierarchyPrecomputation.ContractionVertex<V>, Map<ContractionHierarchyPrecomputation.ContractionVertex<V>, Pair<Double, ContractionHierarchyPrecomputation.ContractionEdge<E>>>> backwardSearchSpaces, Map<Pair<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionVertex<V>>, Pair<Double, ContractionHierarchyPrecomputation.ContractionVertex<V>>> distanceAndMiddleVertexMap) Constructs a new instance for the givengraph
,contractionGraph
,contractionMapping
,forwardSearchSpaces
,backwardSearchSpaces
anddistanceAndMiddleVertexMap
.ContractionHierarchyBidirectionalDijkstra
(ContractionHierarchyPrecomputation.ContractionHierarchy<V, E> hierarchy) Constructs a new instance of the algorithm for a givenhierarchy
.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 givenhierarchy
,radius
andheapSupplier
.TransitNodeRouting
(ContractionHierarchyPrecomputation.ContractionHierarchy<V, E> contractionHierarchy, Set<ContractionHierarchyPrecomputation.ContractionVertex<V>> transitVertices, ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths<V, E> transitVerticesPaths, TransitNodeRoutingPrecomputation.VoronoiDiagram<V> voronoiDiagram, TransitNodeRoutingPrecomputation.AccessVertices<V, E> accessVertices, TransitNodeRoutingPrecomputation.LocalityFilter<V> localityFilter) Constructs a new instance for the givencontractionHierarchy
,transitVertices
,transitVerticesPaths
,voronoiDiagram
,accessVertices
andlocalityFilter
.TransitNodeRoutingPrecomputation
(ContractionHierarchyPrecomputation.ContractionHierarchy<V, E> hierarchy, int numberOfTransitVertices, ThreadPoolExecutor executor) Constructs an instance of the algorithm for a givencontractionHierarchy
,numberOfTransitVertices
andexecutor
.TransitNodeRoutingPrecomputation
(ContractionHierarchyPrecomputation.ContractionHierarchy<V, E> hierarchy, int numberOfTransitVertices, Supplier<org.jheaps.AddressableHeap<Double, ContractionHierarchyPrecomputation.ContractionVertex<V>>> heapSupplier, ThreadPoolExecutor executor) Constructs an instance of the algorithm for a givencontractionHierarchy
,parallelism
,numberOfTransitVertices
,heapSupplier
andexecutor
.TransitNodeRoutingPrecomputation
(ContractionHierarchyPrecomputation.ContractionHierarchy<V, E> hierarchy, ThreadPoolExecutor executor) Constructs an instance of the algorithm for the givencontractionHierarchy
andexecutor
.