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>
private class TransitNodeRoutingPrecomputation.AccessVerticesBuilder extends java.lang.Object
Provides API to build anAccessVertices
object.
-
-
Field Summary
Fields Modifier and Type Field Description private java.util.List<java.util.List<TransitNodeRoutingPrecomputation.AccessVertex<V,E>>>
backwardAccessVertices
For every vertex incontractionGraph
stores a list of backward access vertices.private java.util.List<java.util.List<TransitNodeRoutingPrecomputation.AccessVertex<V,E>>>
forwardAccessVertices
For every vertex incontractionGraph
stores a list of forward access vertices.
-
Constructor Summary
Constructors Constructor Description AccessVerticesBuilder(int numberOfVertices)
Constructs an instance for the givennumberOfVertices
.
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description void
addBackwardAccessVertices(ContractionHierarchyPrecomputation.ContractionVertex<V> v, java.util.Set<V> vertices)
Computes a list of backward access vertices forv
usingvertices
and adds them to thebackwardAccessVertices
.void
addForwardAccessVertices(ContractionHierarchyPrecomputation.ContractionVertex<V> v, java.util.Set<V> vertices)
Computes a list of forward access vertices forv
usingvertices
and adds them to theforwardAccessVertices
.TransitNodeRoutingPrecomputation.AccessVertices<V,E>
buildVertices()
Builds a new instance ofAccessVertices
usingforwardAccessVertices
andbackwardAccessVertices
.private java.util.Set<V>
getPrunedAccessVertices(V v, java.util.Set<V> vertices, ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths<V,E> manyToManyShortestPaths, boolean forwardAccessVertices)
Selects redundant access vertices fromvertices
.
-
-
-
Field Detail
-
forwardAccessVertices
private java.util.List<java.util.List<TransitNodeRoutingPrecomputation.AccessVertex<V,E>>> forwardAccessVertices
For every vertex incontractionGraph
stores 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
private java.util.List<java.util.List<TransitNodeRoutingPrecomputation.AccessVertex<V,E>>> backwardAccessVertices
For every vertex incontractionGraph
stores 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.
-
-
Method Detail
-
buildVertices
public TransitNodeRoutingPrecomputation.AccessVertices<V,E> buildVertices()
Builds a new instance ofAccessVertices
usingforwardAccessVertices
andbackwardAccessVertices
.- Returns:
- access vertices
-
addForwardAccessVertices
public void addForwardAccessVertices(ContractionHierarchyPrecomputation.ContractionVertex<V> v, java.util.Set<V> vertices)
Computes a list of forward access vertices forv
usingvertices
and adds them to theforwardAccessVertices
.- Parameters:
v
- vertexvertices
- transit vertices
-
addBackwardAccessVertices
public void addBackwardAccessVertices(ContractionHierarchyPrecomputation.ContractionVertex<V> v, java.util.Set<V> vertices)
Computes a list of backward access vertices forv
usingvertices
and adds them to thebackwardAccessVertices
.- Parameters:
v
- vertexvertices
- transit vertices
-
getPrunedAccessVertices
private java.util.Set<V> getPrunedAccessVertices(V v, java.util.Set<V> vertices, ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths<V,E> manyToManyShortestPaths, boolean forwardAccessVertices)
Selects redundant access vertices fromvertices
.- Parameters:
v
- vertexvertices
- transit verticesmanyToManyShortestPaths
- transit vertices pathsforwardAccessVertices
- ifvertices
are forward access vertices for not wrtv
- Returns:
- redundant access vertices
-
-