Uses of Class
org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.AccessVertex

Packages that use TransitNodeRoutingPrecomputation.AccessVertex

Package	Description
org.jgrapht.alg.shortestpath	Shortest-path related algorithms.

Uses of TransitNodeRoutingPrecomputation.AccessVertex in org.jgrapht.alg.shortestpath

Fields in org.jgrapht.alg.shortestpath with type parameters of type TransitNodeRoutingPrecomputation.AccessVertex

Modifier and Type	Field	Description
private java.util.List<java.util.List<TransitNodeRoutingPrecomputation.AccessVertex<V,E>>>	TransitNodeRoutingPrecomputation.AccessVertices.backwardAccessVertices	For each vertex in contractionGraph stores corresponding backward access vertices.
private java.util.List<java.util.List<TransitNodeRoutingPrecomputation.AccessVertex<V,E>>>	TransitNodeRoutingPrecomputation.AccessVerticesBuilder.backwardAccessVertices	For every vertex in contractionGraph stores a list of backward access vertices.
private java.util.List<java.util.List<TransitNodeRoutingPrecomputation.AccessVertex<V,E>>>	TransitNodeRoutingPrecomputation.AccessVertices.forwardAccessVertices	For each vertex in contractionGraph stores corresponding forward access vertices.
private java.util.List<java.util.List<TransitNodeRoutingPrecomputation.AccessVertex<V,E>>>	TransitNodeRoutingPrecomputation.AccessVerticesBuilder.forwardAccessVertices	For every vertex in contractionGraph stores a list of forward access vertices.

Methods in org.jgrapht.alg.shortestpath that return types with arguments of type TransitNodeRoutingPrecomputation.AccessVertex

Modifier and Type	Method	Description
java.util.List<TransitNodeRoutingPrecomputation.AccessVertex<V,E>>	TransitNodeRoutingPrecomputation.AccessVertices.getBackwardAccessVertices(ContractionHierarchyPrecomputation.ContractionVertex<V> vertex)	Given a contraction vertex vertex returns its backward access vertices
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 Pair<TransitNodeRoutingPrecomputation.AccessVertex<V,E>,TransitNodeRoutingPrecomputation.AccessVertex<V,E>>	TransitNodeRoutingShortestPath.getMinWeightAccessVertices(V source, V sink)	For vertices source and sink finds pair of access vertices with smallest weight over all pairs.
private Pair<TransitNodeRoutingPrecomputation.AccessVertex<V,E>,TransitNodeRoutingPrecomputation.AccessVertex<V,E>>	TransitNodeRoutingShortestPath.getMinWeightAccessVertices(V source, V sink)	For vertices source and sink finds pair of access vertices with smallest weight over all pairs.

Constructor parameters in org.jgrapht.alg.shortestpath with type arguments of type TransitNodeRoutingPrecomputation.AccessVertex

Constructor	Description
AccessVertices(java.util.List<java.util.List<TransitNodeRoutingPrecomputation.AccessVertex<V,E>>> forwardAccessVertices, java.util.List<java.util.List<TransitNodeRoutingPrecomputation.AccessVertex<V,E>>> backwardAccessVertices)	Constructs a new instance for the given forwardAccessVertices and backwardAccessVertices.