Module org.jgrapht.core
Package org.jgrapht.alg.shortestpath
Class TransitNodeRoutingPrecomputation.AccessVerticesBuilder
java.lang.Object
org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.AccessVerticesBuilder
- Enclosing class:
TransitNodeRoutingPrecomputation<V,E>
Provides API to build an
AccessVertices object.-
Field Summary
FieldsModifier and TypeFieldDescriptionprivate List<List<TransitNodeRoutingPrecomputation.AccessVertex<V, E>>> For every vertex incontractionGraphstores a list of backward access vertices.private List<List<TransitNodeRoutingPrecomputation.AccessVertex<V, E>>> For every vertex incontractionGraphstores a list of forward access vertices. -
Constructor Summary
ConstructorsConstructorDescriptionAccessVerticesBuilder(int numberOfVertices) Constructs an instance for the givennumberOfVertices. -
Method Summary
Modifier and TypeMethodDescriptionvoidaddBackwardAccessVertices(ContractionHierarchyPrecomputation.ContractionVertex<V> v, Set<V> vertices) Computes a list of backward access vertices forvusingverticesand adds them to thebackwardAccessVertices.voidaddForwardAccessVertices(ContractionHierarchyPrecomputation.ContractionVertex<V> v, Set<V> vertices) Computes a list of forward access vertices forvusingverticesand adds them to theforwardAccessVertices.Builds a new instance ofAccessVerticesusingforwardAccessVerticesandbackwardAccessVertices.getPrunedAccessVertices(V v, Set<V> vertices, ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths<V, E> manyToManyShortestPaths, boolean forwardAccessVertices) Selects redundant access vertices fromvertices.
-
Field Details
-
forwardAccessVertices
For every vertex incontractionGraphstores a list of forward access vertices. Id of a contracted vertex is equal to the index in this list, at which corresponding access vertices are stored. -
backwardAccessVertices
For every vertex incontractionGraphstores a list of backward access vertices. Id of a contracted vertex is equal to the index in this list, at which corresponding access vertices are stored.
-
-
Constructor Details
-
AccessVerticesBuilder
public AccessVerticesBuilder(int numberOfVertices) Constructs an instance for the givennumberOfVertices.- Parameters:
numberOfVertices- number of vertices in a m graph
-
-
Method Details
-
buildVertices
Builds a new instance ofAccessVerticesusingforwardAccessVerticesandbackwardAccessVertices.- Returns:
- access vertices
-
addForwardAccessVertices
public void addForwardAccessVertices(ContractionHierarchyPrecomputation.ContractionVertex<V> v, Set<V> vertices) Computes a list of forward access vertices forvusingverticesand adds them to theforwardAccessVertices.- Parameters:
v- vertexvertices- transit vertices
-
addBackwardAccessVertices
public void addBackwardAccessVertices(ContractionHierarchyPrecomputation.ContractionVertex<V> v, Set<V> vertices) Computes a list of backward access vertices forvusingverticesand adds them to thebackwardAccessVertices.- Parameters:
v- vertexvertices- transit vertices
-
getPrunedAccessVertices
private Set<V> getPrunedAccessVertices(V v, Set<V> vertices, ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths<V, E> manyToManyShortestPaths, boolean forwardAccessVertices) Selects redundant access vertices fromvertices.- Parameters:
v- vertexvertices- transit verticesmanyToManyShortestPaths- transit vertices pathsforwardAccessVertices- ifverticesare forward access vertices for not wrtv- Returns:
- redundant access vertices
-