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

Classes in org.jgrapht.alg.shortestpath that implement interfaces with type arguments of type ContractionHierarchyPrecomputation.ContractionEdge

Modifier and Type	Class	Description
private class	ContractionHierarchyPrecomputation.ToListConsumer	Caches passed shortcuts into a list.
private class	ContractionHierarchyPrecomputation.ToListConsumer	Caches passed shortcuts into a list.
private class	ContractionHierarchyPrecomputation.ToStatisticsConsumer	Uses passed shortcuts to compute addedContractionEdges and addedOriginalEdges statistics.
private class	ContractionHierarchyPrecomputation.ToStatisticsConsumer	Uses passed shortcuts to compute addedContractionEdges and addedOriginalEdges statistics.

Fields in org.jgrapht.alg.shortestpath with type parameters of type ContractionHierarchyPrecomputation.ContractionEdge

Modifier and Type	Field	Description
private Map<ContractionHierarchyPrecomputation.ContractionVertex<V>, Map<ContractionHierarchyPrecomputation.ContractionVertex<V>, Pair<Double, ContractionHierarchyPrecomputation.ContractionEdge<E>>>>	CHManyToManyShortestPaths.CHManyToManyShortestPathsImpl.backwardSearchSpaces	Stores backward search space for each target vertex.
(package private) Pair<ContractionHierarchyPrecomputation.ContractionEdge<E1>, ContractionHierarchyPrecomputation.ContractionEdge<E1>>	ContractionHierarchyPrecomputation.ContractionEdge.bypassedEdges	Pair of edges this edge bypasses in case it is a shortcut.
(package private) Pair<ContractionHierarchyPrecomputation.ContractionEdge<E1>, ContractionHierarchyPrecomputation.ContractionEdge<E1>>	ContractionHierarchyPrecomputation.ContractionEdge.bypassedEdges	Pair of edges this edge bypasses in case it is a shortcut.
private final Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionEdge<E>>	CHManyToManyShortestPaths.CHManyToManyShortestPathsImpl.contractionGraph	Contraction hierarchy for graph.
private Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionEdge<E>>	CHManyToManyShortestPaths.contractionGraph	Contracted version of graph.
private Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionEdge<E>>	ContractionHierarchyBidirectionalDijkstra.contractionGraph	Contracted graph, which is used during the queries.
private Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionEdge<E>>	ContractionHierarchyPrecomputation.contractionGraph	Graph that stores the computed contraction hierarchy.
private Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionEdge<E>>	ContractionHierarchyPrecomputation.ContractionHierarchy.contractionGraph	Graph that stores the computed contraction hierarchy.
private Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionEdge<E>>	TransitNodeRoutingPrecomputation.contractionGraph	Contracted graph.
private Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionEdge<E>>	TransitNodeRoutingPrecomputation.ContractionHierarchyBFS.contractionGraph	Search graph.
private Map<ContractionHierarchyPrecomputation.ContractionVertex<V>, Map<ContractionHierarchyPrecomputation.ContractionVertex<V>, Pair<Double, ContractionHierarchyPrecomputation.ContractionEdge<E>>>>	CHManyToManyShortestPaths.CHManyToManyShortestPathsImpl.forwardSearchSpaces	Stores forward search space for each start vertex.
private Supplier<org.jheaps.AddressableHeap<Double, Pair<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionEdge<E>>>>	ContractionHierarchyBidirectionalDijkstra.heapSupplier	Supplier for preferable heap implementation.
private Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionEdge<E>>	ContractionHierarchyPrecomputation.maskedContractionGraph	The immutable view of the contractionGraph which masks already contracted vertices.
private List<List<Pair<ContractionHierarchyPrecomputation.ContractionEdge<E>, ContractionHierarchyPrecomputation.ContractionEdge<E>>>>	ContractionHierarchyPrecomputation.shortcutEdges	Lists of shortcuts that correspond to vertices in the contractionGraph.
private List<List<Pair<ContractionHierarchyPrecomputation.ContractionEdge<E>, ContractionHierarchyPrecomputation.ContractionEdge<E>>>>	ContractionHierarchyPrecomputation.shortcutEdges	Lists of shortcuts that correspond to vertices in the contractionGraph.
(package private) List<Pair<ContractionHierarchyPrecomputation.ContractionEdge<E>, ContractionHierarchyPrecomputation.ContractionEdge<E>>>	ContractionHierarchyPrecomputation.ToListConsumer.shortcuts	Resulting list of shortcuts.
(package private) List<Pair<ContractionHierarchyPrecomputation.ContractionEdge<E>, ContractionHierarchyPrecomputation.ContractionEdge<E>>>	ContractionHierarchyPrecomputation.ToListConsumer.shortcuts	Resulting list of shortcuts.

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.
private Map<ContractionHierarchyPrecomputation.ContractionVertex<V>, Pair<Double, ContractionHierarchyPrecomputation.ContractionEdge<E>>>	CHManyToManyShortestPaths.getDistanceAndPredecessorMap(Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionEdge<E>> contractionGraph, ContractionHierarchyPrecomputation.ContractionVertex<V> source, Set<ContractionHierarchyPrecomputation.ContractionVertex<V>> targets)	Computes distance and predecessor map for a single source shortest paths search starting at source and finishing the search as soon as all targets are reached.
private List<Pair<ContractionHierarchyPrecomputation.ContractionEdge<E>, ContractionHierarchyPrecomputation.ContractionEdge<E>>>	ContractionHierarchyPrecomputation.getShortcuts(ContractionHierarchyPrecomputation.ContractionVertex<V> vertex)	Computes shortcuts for vertex vertex wrt the overlay graph.
private List<Pair<ContractionHierarchyPrecomputation.ContractionEdge<E>, ContractionHierarchyPrecomputation.ContractionEdge<E>>>	ContractionHierarchyPrecomputation.getShortcuts(ContractionHierarchyPrecomputation.ContractionVertex<V> vertex)	Computes shortcuts for vertex vertex wrt the overlay graph.

Methods in org.jgrapht.alg.shortestpath with parameters of type ContractionHierarchyPrecomputation.ContractionEdge

Modifier and Type	Method	Description
void	ContractionHierarchyPrecomputation.ToListConsumer.accept(ContractionHierarchyPrecomputation.ContractionEdge<E> e1, ContractionHierarchyPrecomputation.ContractionEdge<E> e2)
void	ContractionHierarchyPrecomputation.ToStatisticsConsumer.accept(ContractionHierarchyPrecomputation.ContractionEdge<E> e1, ContractionHierarchyPrecomputation.ContractionEdge<E> e2)
void	ContractionHierarchyPrecomputation.ContractionHierarchy.unpackBackward(ContractionHierarchyPrecomputation.ContractionEdge<E> edge, LinkedList<V> vertexList, LinkedList<E> edgeList)	Unpacks edge by recursively going from target to source.
void	ContractionHierarchyPrecomputation.ContractionHierarchy.unpackForward(ContractionHierarchyPrecomputation.ContractionEdge<E> edge, LinkedList<V> vertexList, LinkedList<E> edgeList)	Unpacks edge by recursively going from source to target.

Method parameters in org.jgrapht.alg.shortestpath with type arguments of type ContractionHierarchyPrecomputation.ContractionEdge

Modifier and Type	Method	Description
private void	CHManyToManyShortestPaths.backwardSearch(Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionEdge<E>> contractionGraph, ContractionHierarchyPrecomputation.ContractionVertex<V> target, Set<ContractionHierarchyPrecomputation.ContractionVertex<V>> contractedSources, Map<ContractionHierarchyPrecomputation.ContractionVertex<V>, List<CHManyToManyShortestPaths<V,E>.BucketEntry>> bucketsMap, Map<ContractionHierarchyPrecomputation.ContractionVertex<V>, Map<ContractionHierarchyPrecomputation.ContractionVertex<V>, Pair<Double, ContractionHierarchyPrecomputation.ContractionEdge<E>>>> backwardSearchSpaces, boolean reversed)	Performs backward single source shortest paths search in contractionGraph starting from target to sources.
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 between source and sink based on the information provided by search frontiers and common vertex.
private void	CHManyToManyShortestPaths.forwardSearch(Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionEdge<E>> contractionGraph, ContractionHierarchyPrecomputation.ContractionVertex<V> source, Set<ContractionHierarchyPrecomputation.ContractionVertex<V>> contractedTargets, Map<ContractionHierarchyPrecomputation.ContractionVertex<V>, List<CHManyToManyShortestPaths<V,E>.BucketEntry>> bucketsMap, Map<ContractionHierarchyPrecomputation.ContractionVertex<V>, Map<ContractionHierarchyPrecomputation.ContractionVertex<V>, Pair<Double, ContractionHierarchyPrecomputation.ContractionEdge<E>>>> forwardSearchSpaces, Map<Pair<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionVertex<V>>, Pair<Double, ContractionHierarchyPrecomputation.ContractionVertex<V>>> middleVerticesMap, boolean reversed)	Performs forward search from the given source to targets.
private Map<ContractionHierarchyPrecomputation.ContractionVertex<V>, Pair<Double, ContractionHierarchyPrecomputation.ContractionEdge<E>>>	CHManyToManyShortestPaths.getDistanceAndPredecessorMap(Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionEdge<E>> contractionGraph, ContractionHierarchyPrecomputation.ContractionVertex<V> source, Set<ContractionHierarchyPrecomputation.ContractionVertex<V>> targets)	Computes distance and predecessor map for a single source shortest paths search starting at source and finishing the search as soon as all targets are reached.
private void	ContractionHierarchyPrecomputation.iterateShortcutEdges(ContractionHierarchyPrecomputation.ContractionVertex<V> vertex, BiConsumer<ContractionHierarchyPrecomputation.ContractionEdge<E>, ContractionHierarchyPrecomputation.ContractionEdge<E>> shortcutConsumer)	Runs forward shortest-path searches in current overlay graph to find shortcuts of vertex.
private void	ContractionHierarchyPrecomputation.iterateShortcutEdges(ContractionHierarchyPrecomputation.ContractionVertex<V> vertex, BiConsumer<ContractionHierarchyPrecomputation.ContractionEdge<E>, ContractionHierarchyPrecomputation.ContractionEdge<E>> shortcutConsumer)	Runs forward shortest-path searches in current overlay graph to find shortcuts of vertex.
private Map<ContractionHierarchyPrecomputation.ContractionVertex<V>, org.jheaps.AddressableHeap.Handle<Double, ContractionHierarchyPrecomputation.ContractionVertex<V>>>	ContractionHierarchyPrecomputation.iterateToSuccessors(Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionEdge<E>> graph, ContractionHierarchyPrecomputation.ContractionVertex<V> source, Set<ContractionHierarchyPrecomputation.ContractionVertex<V>> successors, ContractionHierarchyPrecomputation.ContractionVertex<V> vertexToIgnore, double radius)	Performs Dijkstra search in the graph starting at vertex source ignoring vertex vertexToIgnore.
private void	ContractionHierarchyPrecomputation.relaxNode(Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionEdge<E>> graph, org.jheaps.AddressableHeap<Double, ContractionHierarchyPrecomputation.ContractionVertex<V>> heap, Map<ContractionHierarchyPrecomputation.ContractionVertex<V>, org.jheaps.AddressableHeap.Handle<Double, ContractionHierarchyPrecomputation.ContractionVertex<V>>> distanceMap, ContractionHierarchyPrecomputation.ContractionVertex<V> vertex, double vertexDistance, ContractionHierarchyPrecomputation.ContractionVertex<V> vertexToIgnore)	Relaxes outgoing edges of vertex in graph ignoring successors marked as independent and vertexToIgnore.

Constructor parameters in org.jgrapht.alg.shortestpath with type arguments of type ContractionHierarchyPrecomputation.ContractionEdge

Modifier	Constructor	Description
	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 given graph, contractionGraph, contractionMapping, forwardSearchSpaces, backwardSearchSpaces and distanceAndMiddleVertexMap.
(package private)	ContractionEdge(Pair<ContractionHierarchyPrecomputation.ContractionEdge<E1>, ContractionHierarchyPrecomputation.ContractionEdge<E1>> bypassedEdges)	Constrcuts a contraction edge for the given pair of bypassed edges.
(package private)	ContractionEdge(Pair<ContractionHierarchyPrecomputation.ContractionEdge<E1>, ContractionHierarchyPrecomputation.ContractionEdge<E1>> bypassedEdges)	Constrcuts a contraction edge for the given pair of bypassed edges.
	ContractionHierarchyBFS(Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionEdge<E>> contractionGraph)	Constructs a new instance of the algorithm for the given graph.
	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 given hierarchy, radius and heapSupplier.