Uses of Class
org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.ContractionEdge
-
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 voidContractionHierarchyPrecomputation.ContractionHierarchy. unpackBackward(ContractionHierarchyPrecomputation.ContractionEdge<E> edge, java.util.LinkedList<V> vertexList, java.util.LinkedList<E> edgeList)Unpacksedgeby recursively going from target to source.voidContractionHierarchyPrecomputation.ContractionHierarchy. unpackForward(ContractionHierarchyPrecomputation.ContractionEdge<E> edge, java.util.LinkedList<V> vertexList, java.util.LinkedList<E> edgeList)Unpacksedgeby 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, 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,radiusandheapSupplier.
-