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

Fields in org.jgrapht.alg.shortestpath declared as ContractionHierarchyPrecomputation.ContractionVertex

Modifier and Type	Field	Description
(package private) ContractionHierarchyPrecomputation.ContractionVertex<V>	CHManyToManyShortestPaths.BucketEntry.target	Start vertex of the backward search during which this entry is created.

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

Modifier and Type	Field	Description
private java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,Pair<java.lang.Double,ContractionHierarchyPrecomputation.ContractionEdge<E>>>>	CHManyToManyShortestPaths.CHManyToManyShortestPathsImpl.backwardSearchSpaces	Stores backward search space for each target vertex.
private java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,Pair<java.lang.Double,ContractionHierarchyPrecomputation.ContractionEdge<E>>>>	CHManyToManyShortestPaths.CHManyToManyShortestPathsImpl.backwardSearchSpaces	Stores backward search space for each target vertex.
private java.util.function.Consumer<ContractionHierarchyPrecomputation.ContractionVertex<V>>	ContractionHierarchyPrecomputation.computeIndependentSetConsumer	Computes independent set during contraction.
private java.util.List<java.util.function.Consumer<ContractionHierarchyPrecomputation.ContractionVertex<V>>>	ContractionHierarchyPrecomputation.computeInitialPrioritiesConsumers	Consumers that perform computation of initial priorities for vertices in contractionGraph.
private java.util.function.Consumer<ContractionHierarchyPrecomputation.ContractionVertex<V>>	ContractionHierarchyPrecomputation.computeShortcutsConsumer	Computes shortcuts for a vertex.
(package private) java.util.function.Consumer<ContractionHierarchyPrecomputation.ContractionVertex<V>>	ContractionHierarchyPrecomputation.ContractionTask.consumer	Performs needed action with vertices.
private java.util.Set<ContractionHierarchyPrecomputation.ContractionVertex<V>>	TransitNodeRoutingPrecomputation.contractedTransitVerticesSet	Set of contracted transit vertices.
private 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 java.util.Map<V,ContractionHierarchyPrecomputation.ContractionVertex<V>>	CHManyToManyShortestPaths.CHManyToManyShortestPathsImpl.contractionMapping	Mapping from original to contracted vertices.
private java.util.Map<V,ContractionHierarchyPrecomputation.ContractionVertex<V>>	CHManyToManyShortestPaths.contractionMapping	Mapping from vertices in the original graph to vertices in the contractionGraph.
private java.util.Map<V,ContractionHierarchyPrecomputation.ContractionVertex<V>>	ContractionHierarchyBidirectionalDijkstra.contractionMapping	Mapping from original to contracted vertices.
private java.util.Map<V,ContractionHierarchyPrecomputation.ContractionVertex<V>>	ContractionHierarchyPrecomputation.ContractionHierarchy.contractionMapping	Mapping of the vertices in the original graph to the vertices in the contraction hierarchy graph.
private java.util.Map<V,ContractionHierarchyPrecomputation.ContractionVertex<V>>	ContractionHierarchyPrecomputation.contractionMapping	Mapping of the vertices in the original graph to the vertices in the contraction hierarchy graph.
private java.util.Map<V,ContractionHierarchyPrecomputation.ContractionVertex<V>>	TransitNodeRoutingPrecomputation.contractionMapping	Mapping of vertices in the initial graph to contracted vertices.
private java.util.Map<V,ContractionHierarchyPrecomputation.ContractionVertex<V>>	TransitNodeRoutingPrecomputation.LocalityFilter.contractionMapping	Mapping of vertices in the initial graph to the vertices in the contraction graph.
private java.util.List<ContractionHierarchyPrecomputation.ContractionVertex<V>>	TransitNodeRoutingPrecomputation.contractionVertices	List of contracted vertices.
private java.util.Map<Pair<ContractionHierarchyPrecomputation.ContractionVertex<V>,ContractionHierarchyPrecomputation.ContractionVertex<V>>,Pair<java.lang.Double,ContractionHierarchyPrecomputation.ContractionVertex<V>>>	CHManyToManyShortestPaths.CHManyToManyShortestPathsImpl.distanceAndMiddleVertexMap	Stores pair of path weight and middle vertex for each source-target pair.
private java.util.Map<Pair<ContractionHierarchyPrecomputation.ContractionVertex<V>,ContractionHierarchyPrecomputation.ContractionVertex<V>>,Pair<java.lang.Double,ContractionHierarchyPrecomputation.ContractionVertex<V>>>	CHManyToManyShortestPaths.CHManyToManyShortestPathsImpl.distanceAndMiddleVertexMap	Stores pair of path weight and middle vertex for each source-target pair.
private java.util.Map<Pair<ContractionHierarchyPrecomputation.ContractionVertex<V>,ContractionHierarchyPrecomputation.ContractionVertex<V>>,Pair<java.lang.Double,ContractionHierarchyPrecomputation.ContractionVertex<V>>>	CHManyToManyShortestPaths.CHManyToManyShortestPathsImpl.distanceAndMiddleVertexMap	Stores pair of path weight and middle vertex for each source-target pair.
private java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,Pair<java.lang.Double,ContractionHierarchyPrecomputation.ContractionEdge<E>>>>	CHManyToManyShortestPaths.CHManyToManyShortestPathsImpl.forwardSearchSpaces	Stores forward search space for each start vertex.
private java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,Pair<java.lang.Double,ContractionHierarchyPrecomputation.ContractionEdge<E>>>>	CHManyToManyShortestPaths.CHManyToManyShortestPathsImpl.forwardSearchSpaces	Stores forward search space for each start vertex.
private org.jheaps.AddressableHeap<java.lang.Double,ContractionHierarchyPrecomputation.ContractionVertex<V>>	TransitNodeRoutingPrecomputation.VoronoiDiagramComputation.heap	Priority queue which stores vertices ordered by theirs distances to the corresponding Voronoi cell center.
private java.util.function.Supplier<org.jheaps.AddressableHeap<java.lang.Double,Pair<ContractionHierarchyPrecomputation.ContractionVertex<V>,ContractionHierarchyPrecomputation.ContractionEdge<E>>>>	ContractionHierarchyBidirectionalDijkstra.heapSupplier	Supplier for preferable heap implementation.
private java.util.function.Supplier<org.jheaps.AddressableHeap<java.lang.Double,ContractionHierarchyPrecomputation.ContractionVertex<V>>>	TransitNodeRoutingPrecomputation.heapSupplier	Supplier for the preferable heap implementation.
private java.util.function.Consumer<ContractionHierarchyPrecomputation.ContractionVertex<V>>	ContractionHierarchyPrecomputation.markUpwardEdgesConsumer	Sets value of isUpward for the outgoing edges of a vertex.
private Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>,ContractionHierarchyPrecomputation.ContractionEdge<E>>	ContractionHierarchyPrecomputation.maskedContractionGraph	The immutable view of the contractionGraph which masks already contracted vertices.
private java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,org.jheaps.AddressableHeap.Handle<java.lang.Double,ContractionHierarchyPrecomputation.ContractionVertex<V>>>	TransitNodeRoutingPrecomputation.VoronoiDiagramComputation.seen	For every vertex added to the heap stores a corresponding handle.
private java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,org.jheaps.AddressableHeap.Handle<java.lang.Double,ContractionHierarchyPrecomputation.ContractionVertex<V>>>	TransitNodeRoutingPrecomputation.VoronoiDiagramComputation.seen	For every vertex added to the heap stores a corresponding handle.
private java.util.function.Supplier<org.jheaps.AddressableHeap<java.lang.Double,ContractionHierarchyPrecomputation.ContractionVertex<V>>>	ContractionHierarchyPrecomputation.shortcutsSearchHeapSupplier	Supplier for the preferable heap implementation.
private java.util.Set<ContractionHierarchyPrecomputation.ContractionVertex<V>>	TransitNodeRoutingPrecomputation.TransitNodeRouting.transitVertices	Selected transit vertices.
private java.util.function.Consumer<ContractionHierarchyPrecomputation.ContractionVertex<V>>	ContractionHierarchyPrecomputation.updateNeighboursConsumer	Updates neighbours priorities of a vertex.
private java.util.List<ContractionHierarchyPrecomputation.ContractionVertex<V>>	ContractionHierarchyPrecomputation.vertices	Vertices of the contractionGraph.

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.
private java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,Pair<java.lang.Double,ContractionHierarchyPrecomputation.ContractionEdge<E>>>	CHManyToManyShortestPaths.getDistanceAndPredecessorMap(Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>,ContractionHierarchyPrecomputation.ContractionEdge<E>> contractionGraph, ContractionHierarchyPrecomputation.ContractionVertex<V> source, java.util.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.
java.util.Set<ContractionHierarchyPrecomputation.ContractionVertex<V>>	TransitNodeRoutingPrecomputation.TransitNodeRouting.getTransitVertices()	Returns transit vertices of this transit node routing.
private java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,org.jheaps.AddressableHeap.Handle<java.lang.Double,ContractionHierarchyPrecomputation.ContractionVertex<V>>>	ContractionHierarchyPrecomputation.iterateToSuccessors(Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>,ContractionHierarchyPrecomputation.ContractionEdge<E>> graph, ContractionHierarchyPrecomputation.ContractionVertex<V> source, java.util.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 java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,org.jheaps.AddressableHeap.Handle<java.lang.Double,ContractionHierarchyPrecomputation.ContractionVertex<V>>>	ContractionHierarchyPrecomputation.iterateToSuccessors(Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>,ContractionHierarchyPrecomputation.ContractionEdge<E>> graph, ContractionHierarchyPrecomputation.ContractionVertex<V> source, java.util.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 java.util.Set<ContractionHierarchyPrecomputation.ContractionVertex<V>>	TransitNodeRoutingPrecomputation.selectTopKTransitVertices(int numberOfTransitVertices)	Selects top numberOfTransitVertices vertices in the contraction hierarchy as transit vertices.

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

Modifier and Type	Method	Description
void	TransitNodeRoutingPrecomputation.AccessVerticesBuilder.addBackwardAccessVertices(ContractionHierarchyPrecomputation.ContractionVertex<V> v, java.util.Set<V> vertices)	Computes a list of backward access vertices for v using vertices and adds them to the backwardAccessVertices.
void	TransitNodeRoutingPrecomputation.LocalityFilterBuilder.addBackwardVisitedVoronoiCells(ContractionHierarchyPrecomputation.ContractionVertex<V> vertex, java.util.Set<java.lang.Integer> visitedVoronoiCells)	Adds visitedVoronoiCells to this builder in the backward direction for vertex.
void	TransitNodeRoutingPrecomputation.AccessVerticesBuilder.addForwardAccessVertices(ContractionHierarchyPrecomputation.ContractionVertex<V> v, java.util.Set<V> vertices)	Computes a list of forward access vertices for v using vertices and adds them to the forwardAccessVertices.
void	TransitNodeRoutingPrecomputation.LocalityFilterBuilder.addForwardVisitedVoronoiCells(ContractionHierarchyPrecomputation.ContractionVertex<V> vertex, java.util.Set<java.lang.Integer> visitedVoronoiCells)	Adds visitedVoronoiCells to this builder in the forward direction for vertex.
private void	CHManyToManyShortestPaths.backwardSearch(Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>,ContractionHierarchyPrecomputation.ContractionEdge<E>> contractionGraph, ContractionHierarchyPrecomputation.ContractionVertex<V> target, java.util.Set<ContractionHierarchyPrecomputation.ContractionVertex<V>> contractedSources, java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,java.util.List<CHManyToManyShortestPaths.BucketEntry>> bucketsMap, java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,Pair<java.lang.Double,ContractionHierarchyPrecomputation.ContractionEdge<E>>>> backwardSearchSpaces, boolean reversed)	Performs backward single source shortest paths search in contractionGraph starting from target to sources.
private void	ContractionHierarchyPrecomputation.contractVertex(ContractionHierarchyPrecomputation.ContractionVertex<V> vertex, int contractionLevel)	Contracts provided vertex and assigns the specified contractionLevel to it.
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, java.util.Set<ContractionHierarchyPrecomputation.ContractionVertex<V>> contractedTargets, java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,java.util.List<CHManyToManyShortestPaths.BucketEntry>> bucketsMap, java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,Pair<java.lang.Double,ContractionHierarchyPrecomputation.ContractionEdge<E>>>> forwardSearchSpaces, java.util.Map<Pair<ContractionHierarchyPrecomputation.ContractionVertex<V>,ContractionHierarchyPrecomputation.ContractionVertex<V>>,Pair<java.lang.Double,ContractionHierarchyPrecomputation.ContractionVertex<V>>> middleVerticesMap, boolean reversed)	Performs forward search from the given source to targets.
java.util.List<TransitNodeRoutingPrecomputation.AccessVertex<V,E>>	TransitNodeRoutingPrecomputation.AccessVertices.getBackwardAccessVertices(ContractionHierarchyPrecomputation.ContractionVertex<V> vertex)	Given a contraction vertex vertex returns its backward access vertices
private java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,Pair<java.lang.Double,ContractionHierarchyPrecomputation.ContractionEdge<E>>>	CHManyToManyShortestPaths.getDistanceAndPredecessorMap(Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>,ContractionHierarchyPrecomputation.ContractionEdge<E>> contractionGraph, ContractionHierarchyPrecomputation.ContractionVertex<V> source, java.util.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.
java.util.List<TransitNodeRoutingPrecomputation.AccessVertex<V,E>>	TransitNodeRoutingPrecomputation.AccessVertices.getForwardAccessVertices(ContractionHierarchyPrecomputation.ContractionVertex<V> vertex)	Given a contraction vertex vertex returns its forward access vertices
private java.util.List<Pair<ContractionHierarchyPrecomputation.ContractionEdge<E>,ContractionHierarchyPrecomputation.ContractionEdge<E>>>	ContractionHierarchyPrecomputation.getShortcuts(ContractionHierarchyPrecomputation.ContractionVertex<V> vertex)	Computes shortcuts for vertex vertex wrt the overlay graph.
private ContractionHierarchyPrecomputation.VertexStatistics	ContractionHierarchyPrecomputation.getStatistics(ContractionHierarchyPrecomputation.ContractionVertex<V> vertex)	Computes statistics for specified vertex.
private ContractionHierarchyPrecomputation.VertexData	ContractionHierarchyPrecomputation.getVertexData(ContractionHierarchyPrecomputation.ContractionVertex<V> vertex, int random)	Creates an instance of VertexData for vertex using specified random number and sets its priority value.
int	TransitNodeRoutingPrecomputation.VoronoiDiagram.getVoronoiCellId(ContractionHierarchyPrecomputation.ContractionVertex<V> vertex)	Returns Voronoi cell id which corresponds to vertex.
private boolean	ContractionHierarchyPrecomputation.isGreater(ContractionHierarchyPrecomputation.ContractionVertex<V> vertex1, ContractionHierarchyPrecomputation.ContractionVertex<V> vertex2)	Determines if priority of vertex1 is greater than the priority of vertex2.
private void	ContractionHierarchyPrecomputation.iterateShortcutEdges(ContractionHierarchyPrecomputation.ContractionVertex<V> vertex, java.util.function.BiConsumer<ContractionHierarchyPrecomputation.ContractionEdge<E>,ContractionHierarchyPrecomputation.ContractionEdge<E>> shortcutConsumer)	Runs forward shortest-path searches in current overlay graph to find shortcuts of vertex.
private java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,org.jheaps.AddressableHeap.Handle<java.lang.Double,ContractionHierarchyPrecomputation.ContractionVertex<V>>>	ContractionHierarchyPrecomputation.iterateToSuccessors(Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>,ContractionHierarchyPrecomputation.ContractionEdge<E>> graph, ContractionHierarchyPrecomputation.ContractionVertex<V> source, java.util.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<java.lang.Double,ContractionHierarchyPrecomputation.ContractionVertex<V>> heap, java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,org.jheaps.AddressableHeap.Handle<java.lang.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.
Pair<java.util.Set<V>,java.util.Set<java.lang.Integer>>	TransitNodeRoutingPrecomputation.ContractionHierarchyBFS.runSearch(ContractionHierarchyPrecomputation.ContractionVertex<V> vertex)	Runs a forward CH BFS query to calculate access vertices and ids of visited Voronoi cells.
private void	ContractionHierarchyPrecomputation.updateDistance(ContractionHierarchyPrecomputation.ContractionVertex<V> vertex, double distance, org.jheaps.AddressableHeap<java.lang.Double,ContractionHierarchyPrecomputation.ContractionVertex<V>> heap, java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,org.jheaps.AddressableHeap.Handle<java.lang.Double,ContractionHierarchyPrecomputation.ContractionVertex<V>>> distanceMap)	Updates distance for vertex in the heap if needed.
private void	TransitNodeRoutingPrecomputation.VoronoiDiagramComputation.updateDistance(ContractionHierarchyPrecomputation.ContractionVertex<V> vertex, ContractionHierarchyPrecomputation.ContractionVertex<V> predecessor, double distance)	If necessary updates distance of the vertex in the heap.
private void	ContractionHierarchyPrecomputation.updateNeighboursData(ContractionHierarchyPrecomputation.ContractionVertex<V> vertex)	Updates neighbours priorities and theirs depth values for a given vertex.
private void	ContractionHierarchyPrecomputation.updatePriority(ContractionHierarchyPrecomputation.ContractionVertex<V> vertex, ContractionHierarchyPrecomputation.VertexData data)	Updates priority field value of data, which corresponds to the vertex.
private boolean	ContractionHierarchyPrecomputation.vertexIsIndependent(ContractionHierarchyPrecomputation.ContractionVertex<V> vertex)	Determines if a vertex is independent wrt the overlay graph.
private void	TransitNodeRoutingPrecomputation.VoronoiDiagramComputation.visitVertex(ContractionHierarchyPrecomputation.ContractionVertex<V> vertex, ContractionHierarchyPrecomputation.ContractionVertex<V> predecessor, double distance)	If necessary updates Voronoi cell id and distance in voronoiCells and distanceToCenter for vertex.

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

Modifier and Type	Method	Description
private void	CHManyToManyShortestPaths.backwardSearch(Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>,ContractionHierarchyPrecomputation.ContractionEdge<E>> contractionGraph, ContractionHierarchyPrecomputation.ContractionVertex<V> target, java.util.Set<ContractionHierarchyPrecomputation.ContractionVertex<V>> contractedSources, java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,java.util.List<CHManyToManyShortestPaths.BucketEntry>> bucketsMap, java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,Pair<java.lang.Double,ContractionHierarchyPrecomputation.ContractionEdge<E>>>> backwardSearchSpaces, boolean reversed)	Performs backward single source shortest paths search in contractionGraph starting from target to sources.
private void	CHManyToManyShortestPaths.backwardSearch(Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>,ContractionHierarchyPrecomputation.ContractionEdge<E>> contractionGraph, ContractionHierarchyPrecomputation.ContractionVertex<V> target, java.util.Set<ContractionHierarchyPrecomputation.ContractionVertex<V>> contractedSources, java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,java.util.List<CHManyToManyShortestPaths.BucketEntry>> bucketsMap, java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,Pair<java.lang.Double,ContractionHierarchyPrecomputation.ContractionEdge<E>>>> backwardSearchSpaces, boolean reversed)	Performs backward single source shortest paths search in contractionGraph starting from target to sources.
private void	CHManyToManyShortestPaths.backwardSearch(Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>,ContractionHierarchyPrecomputation.ContractionEdge<E>> contractionGraph, ContractionHierarchyPrecomputation.ContractionVertex<V> target, java.util.Set<ContractionHierarchyPrecomputation.ContractionVertex<V>> contractedSources, java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,java.util.List<CHManyToManyShortestPaths.BucketEntry>> bucketsMap, java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,Pair<java.lang.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, java.util.Set<ContractionHierarchyPrecomputation.ContractionVertex<V>> contractedTargets, java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,java.util.List<CHManyToManyShortestPaths.BucketEntry>> bucketsMap, java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,Pair<java.lang.Double,ContractionHierarchyPrecomputation.ContractionEdge<E>>>> forwardSearchSpaces, java.util.Map<Pair<ContractionHierarchyPrecomputation.ContractionVertex<V>,ContractionHierarchyPrecomputation.ContractionVertex<V>>,Pair<java.lang.Double,ContractionHierarchyPrecomputation.ContractionVertex<V>>> middleVerticesMap, boolean reversed)	Performs forward search from the given source to targets.
private void	CHManyToManyShortestPaths.forwardSearch(Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>,ContractionHierarchyPrecomputation.ContractionEdge<E>> contractionGraph, ContractionHierarchyPrecomputation.ContractionVertex<V> source, java.util.Set<ContractionHierarchyPrecomputation.ContractionVertex<V>> contractedTargets, java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,java.util.List<CHManyToManyShortestPaths.BucketEntry>> bucketsMap, java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,Pair<java.lang.Double,ContractionHierarchyPrecomputation.ContractionEdge<E>>>> forwardSearchSpaces, java.util.Map<Pair<ContractionHierarchyPrecomputation.ContractionVertex<V>,ContractionHierarchyPrecomputation.ContractionVertex<V>>,Pair<java.lang.Double,ContractionHierarchyPrecomputation.ContractionVertex<V>>> middleVerticesMap, boolean reversed)	Performs forward search from the given source to targets.
private void	CHManyToManyShortestPaths.forwardSearch(Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>,ContractionHierarchyPrecomputation.ContractionEdge<E>> contractionGraph, ContractionHierarchyPrecomputation.ContractionVertex<V> source, java.util.Set<ContractionHierarchyPrecomputation.ContractionVertex<V>> contractedTargets, java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,java.util.List<CHManyToManyShortestPaths.BucketEntry>> bucketsMap, java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,Pair<java.lang.Double,ContractionHierarchyPrecomputation.ContractionEdge<E>>>> forwardSearchSpaces, java.util.Map<Pair<ContractionHierarchyPrecomputation.ContractionVertex<V>,ContractionHierarchyPrecomputation.ContractionVertex<V>>,Pair<java.lang.Double,ContractionHierarchyPrecomputation.ContractionVertex<V>>> middleVerticesMap, boolean reversed)	Performs forward search from the given source to targets.
private java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,Pair<java.lang.Double,ContractionHierarchyPrecomputation.ContractionEdge<E>>>	CHManyToManyShortestPaths.getDistanceAndPredecessorMap(Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>,ContractionHierarchyPrecomputation.ContractionEdge<E>> contractionGraph, ContractionHierarchyPrecomputation.ContractionVertex<V> source, java.util.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 java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,Pair<java.lang.Double,ContractionHierarchyPrecomputation.ContractionEdge<E>>>	CHManyToManyShortestPaths.getDistanceAndPredecessorMap(Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>,ContractionHierarchyPrecomputation.ContractionEdge<E>> contractionGraph, ContractionHierarchyPrecomputation.ContractionVertex<V> source, java.util.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 java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,org.jheaps.AddressableHeap.Handle<java.lang.Double,ContractionHierarchyPrecomputation.ContractionVertex<V>>>	ContractionHierarchyPrecomputation.iterateToSuccessors(Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>,ContractionHierarchyPrecomputation.ContractionEdge<E>> graph, ContractionHierarchyPrecomputation.ContractionVertex<V> source, java.util.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 java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,org.jheaps.AddressableHeap.Handle<java.lang.Double,ContractionHierarchyPrecomputation.ContractionVertex<V>>>	ContractionHierarchyPrecomputation.iterateToSuccessors(Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>,ContractionHierarchyPrecomputation.ContractionEdge<E>> graph, ContractionHierarchyPrecomputation.ContractionVertex<V> source, java.util.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<java.lang.Double,ContractionHierarchyPrecomputation.ContractionVertex<V>> heap, java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,org.jheaps.AddressableHeap.Handle<java.lang.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.
private void	ContractionHierarchyPrecomputation.relaxNode(Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>,ContractionHierarchyPrecomputation.ContractionEdge<E>> graph, org.jheaps.AddressableHeap<java.lang.Double,ContractionHierarchyPrecomputation.ContractionVertex<V>> heap, java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,org.jheaps.AddressableHeap.Handle<java.lang.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.
private void	ContractionHierarchyPrecomputation.relaxNode(Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>,ContractionHierarchyPrecomputation.ContractionEdge<E>> graph, org.jheaps.AddressableHeap<java.lang.Double,ContractionHierarchyPrecomputation.ContractionVertex<V>> heap, java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,org.jheaps.AddressableHeap.Handle<java.lang.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.
private void	ContractionHierarchyPrecomputation.relaxNode(Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>,ContractionHierarchyPrecomputation.ContractionEdge<E>> graph, org.jheaps.AddressableHeap<java.lang.Double,ContractionHierarchyPrecomputation.ContractionVertex<V>> heap, java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,org.jheaps.AddressableHeap.Handle<java.lang.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.
private void	ContractionHierarchyPrecomputation.submitTasks(int segmentStart, int segmentEnd, java.util.function.Consumer<ContractionHierarchyPrecomputation.ContractionVertex<V>> consumer)	Submits tasks to the completionService setting start and end of the working segment and consumer for them
private void	ContractionHierarchyPrecomputation.submitTasks(int segmentStart, int segmentEnd, java.util.List<java.util.function.Consumer<ContractionHierarchyPrecomputation.ContractionVertex<V>>> consumers)	Submits tasks to the completionService setting start and end of the working segment and an individual instance of consumer provided in consumers.
private void	ContractionHierarchyPrecomputation.updateDistance(ContractionHierarchyPrecomputation.ContractionVertex<V> vertex, double distance, org.jheaps.AddressableHeap<java.lang.Double,ContractionHierarchyPrecomputation.ContractionVertex<V>> heap, java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,org.jheaps.AddressableHeap.Handle<java.lang.Double,ContractionHierarchyPrecomputation.ContractionVertex<V>>> distanceMap)	Updates distance for vertex in the heap if needed.
private void	ContractionHierarchyPrecomputation.updateDistance(ContractionHierarchyPrecomputation.ContractionVertex<V> vertex, double distance, org.jheaps.AddressableHeap<java.lang.Double,ContractionHierarchyPrecomputation.ContractionVertex<V>> heap, java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,org.jheaps.AddressableHeap.Handle<java.lang.Double,ContractionHierarchyPrecomputation.ContractionVertex<V>>> distanceMap)	Updates distance for vertex in the heap if needed.
private void	ContractionHierarchyPrecomputation.updateDistance(ContractionHierarchyPrecomputation.ContractionVertex<V> vertex, double distance, org.jheaps.AddressableHeap<java.lang.Double,ContractionHierarchyPrecomputation.ContractionVertex<V>> heap, java.util.Map<ContractionHierarchyPrecomputation.ContractionVertex<V>,org.jheaps.AddressableHeap.Handle<java.lang.Double,ContractionHierarchyPrecomputation.ContractionVertex<V>>> distanceMap)	Updates distance for vertex in the heap if needed.

Constructors in org.jgrapht.alg.shortestpath with parameters of type ContractionHierarchyPrecomputation.ContractionVertex

Constructor	Description
BucketEntry(ContractionHierarchyPrecomputation.ContractionVertex<V> target, double distance)	Constrcuts an instance of an entry for the given target and distance.

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

Constructor	Description
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 given graph, contractionGraph, contractionMapping, forwardSearchSpaces, backwardSearchSpaces and distanceAndMiddleVertexMap.
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 given graph, contractionGraph, contractionMapping, forwardSearchSpaces, backwardSearchSpaces and distanceAndMiddleVertexMap.
ContractionHierarchy(Graph<V,E> graph, Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>,ContractionHierarchyPrecomputation.ContractionEdge<E>> contractionGraph, java.util.Map<V,ContractionHierarchyPrecomputation.ContractionVertex<V>> contractionMapping)	Constructs a new instance for the given graph, contractionGraph and contractionMapping.
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, 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 given hierarchy, radius and heapSupplier.
LocalityFilter(java.util.Map<V,ContractionHierarchyPrecomputation.ContractionVertex<V>> contractionMapping, java.util.List<java.util.Set<java.lang.Integer>> visitedForwardVoronoiCells, java.util.List<java.util.Set<java.lang.Integer>> visitedBackwardVoronoiCells)	Constructs a new instance for the given contractionMapping, visitedForwardVoronoiCells and visitedBackwardVoronoiCells.
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 given contractionHierarchy, transitVertices, transitVerticesPaths, voronoiDiagram, accessVertices and localityFilter.
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 given contractionHierarchy, parallelism, numberOfTransitVertices, heapSupplier and executor.