Uses of Class
org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.ContractionVertex
-
Packages that use ContractionHierarchyPrecomputation.ContractionVertex Package Description org.jgrapht.alg.shortestpath Shortest-path related algorithms. -
-
Uses of ContractionHierarchyPrecomputation.ContractionVertex in org.jgrapht.alg.shortestpath
Methods in org.jgrapht.alg.shortestpath that return types with arguments of type ContractionHierarchyPrecomputation.ContractionVertex Modifier and Type Method Description Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>,ContractionHierarchyPrecomputation.ContractionEdge<E>>
ContractionHierarchyPrecomputation.ContractionHierarchy. getContractionGraph()
Returns contracted graph.java.util.Map<V,ContractionHierarchyPrecomputation.ContractionVertex<V>>
ContractionHierarchyPrecomputation.ContractionHierarchy. getContractionMapping()
Returns mapping of the vertices in the original graph to the vertices in the contracted graph.Constructor parameters in org.jgrapht.alg.shortestpath with type arguments of type ContractionHierarchyPrecomputation.ContractionVertex Constructor Description 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
.
-