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
Fields in org.jgrapht.alg.shortestpath declared as ContractionHierarchyPrecomputation.ContractionHierarchy Modifier and Type Field Description private ContractionHierarchyPrecomputation.ContractionHierarchy<V,E>
CHManyToManyShortestPaths. contractionHierarchy
Contraction hierarchy ofgraph
.private ContractionHierarchyPrecomputation.ContractionHierarchy<V,E>
ContractionHierarchyBidirectionalDijkstra. contractionHierarchy
Contraction hierarchy which is used to compute shortest paths.private ContractionHierarchyPrecomputation.ContractionHierarchy<V,E>
TransitNodeRoutingPrecomputation. contractionHierarchy
Contraction hierarchy which is used to compute transit node routing.private ContractionHierarchyPrecomputation.ContractionHierarchy<V,E>
TransitNodeRoutingPrecomputation.TransitNodeRouting. contractionHierarchy
Contraction hierarchy based on which this transit node routing was computed.private ContractionHierarchyPrecomputation.ContractionHierarchy<V,E>
TransitNodeRoutingShortestPath. contractionHierarchy
Contraction hierarchy which is used to compute shortest paths.Methods in org.jgrapht.alg.shortestpath that return ContractionHierarchyPrecomputation.ContractionHierarchy Modifier and Type Method Description ContractionHierarchyPrecomputation.ContractionHierarchy<V,E>
ContractionHierarchyPrecomputation. computeContractionHierarchy()
Computes contraction hierarchy forgraph
.ContractionHierarchyPrecomputation.ContractionHierarchy<V,E>
TransitNodeRoutingPrecomputation.TransitNodeRouting. getContractionHierarchy()
Returns contraction hierarchy of this transit node routing.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 givencontractionHierarchy
.CHManyToManyShortestPathsImpl(Graph<V,E> graph, ContractionHierarchyPrecomputation.ContractionHierarchy<V,E> hierarchy, java.util.Set<V> sources, java.util.Set<V> targets, java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,Pair<java.lang.Double,ContractionHierarchyPrecomputation.ContractionEdge<E>>>> forwardSearchSpaces, java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,Pair<java.lang.Double,ContractionHierarchyPrecomputation.ContractionEdge<E>>>> backwardSearchSpaces, java.util.Map<Pair<ContractionHierarchyPrecomputation.ContractionVertex<V>,ContractionHierarchyPrecomputation.ContractionVertex<V>>,Pair<java.lang.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, java.util.function.Supplier<org.jheaps.AddressableHeap<java.lang.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, java.util.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, java.util.concurrent.ThreadPoolExecutor executor)
Constructs an instance of the algorithm for a givencontractionHierarchy
,numberOfTransitVertices
andexecutor
.TransitNodeRoutingPrecomputation(ContractionHierarchyPrecomputation.ContractionHierarchy<V,E> hierarchy, int numberOfTransitVertices, java.util.function.Supplier<org.jheaps.AddressableHeap<java.lang.Double,ContractionHierarchyPrecomputation.ContractionVertex<V>>> heapSupplier, java.util.concurrent.ThreadPoolExecutor executor)
Constructs an instance of the algorithm for a givencontractionHierarchy
,parallelism
,numberOfTransitVertices
,heapSupplier
andexecutor
.TransitNodeRoutingPrecomputation(ContractionHierarchyPrecomputation.ContractionHierarchy<V,E> hierarchy, java.util.concurrent.ThreadPoolExecutor executor)
Constructs an instance of the algorithm for the givencontractionHierarchy
andexecutor
.
-