Uses of Class
org.jgrapht.alg.shortestpath.ContractionHierarchyBidirectionalDijkstra.ContractionSearchFrontier
-
Packages that use ContractionHierarchyBidirectionalDijkstra.ContractionSearchFrontier Package Description org.jgrapht.alg.shortestpath Shortest-path related algorithms. -
-
Uses of ContractionHierarchyBidirectionalDijkstra.ContractionSearchFrontier in org.jgrapht.alg.shortestpath
Methods in org.jgrapht.alg.shortestpath with parameters of type ContractionHierarchyBidirectionalDijkstra.ContractionSearchFrontier Modifier and Type Method Description private GraphPath<V,E>
ContractionHierarchyBidirectionalDijkstra. createPath(ContractionHierarchyBidirectionalDijkstra.ContractionSearchFrontier<ContractionHierarchyPrecomputation.ContractionVertex<V>,ContractionHierarchyPrecomputation.ContractionEdge<E>> forwardFrontier, ContractionHierarchyBidirectionalDijkstra.ContractionSearchFrontier<ContractionHierarchyPrecomputation.ContractionVertex<V>,ContractionHierarchyPrecomputation.ContractionEdge<E>> backwardFrontier, double weight, ContractionHierarchyPrecomputation.ContractionVertex<V> source, ContractionHierarchyPrecomputation.ContractionVertex<V> commonVertex, ContractionHierarchyPrecomputation.ContractionVertex<V> sink)
Builds shortest unpacked path betweensource
andsink
based on the information provided by search frontiers and common vertex.
-