Uses of Class
org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.AccessVertex
Packages that use TransitNodeRoutingPrecomputation.AccessVertex
-
Uses of TransitNodeRoutingPrecomputation.AccessVertex in org.jgrapht.alg.shortestpath
Fields in org.jgrapht.alg.shortestpath with type parameters of type TransitNodeRoutingPrecomputation.AccessVertexModifier and TypeFieldDescriptionprivate List
<List<TransitNodeRoutingPrecomputation.AccessVertex<V, E>>> TransitNodeRoutingPrecomputation.AccessVertices.backwardAccessVertices
For each vertex incontractionGraph
stores corresponding backward access vertices.private List
<List<TransitNodeRoutingPrecomputation.AccessVertex<V, E>>> TransitNodeRoutingPrecomputation.AccessVerticesBuilder.backwardAccessVertices
For every vertex incontractionGraph
stores a list of backward access vertices.private List
<List<TransitNodeRoutingPrecomputation.AccessVertex<V, E>>> TransitNodeRoutingPrecomputation.AccessVertices.forwardAccessVertices
For each vertex incontractionGraph
stores corresponding forward access vertices.private List
<List<TransitNodeRoutingPrecomputation.AccessVertex<V, E>>> TransitNodeRoutingPrecomputation.AccessVerticesBuilder.forwardAccessVertices
For every vertex incontractionGraph
stores a list of forward access vertices.Methods in org.jgrapht.alg.shortestpath that return types with arguments of type TransitNodeRoutingPrecomputation.AccessVertexModifier and TypeMethodDescriptionTransitNodeRoutingPrecomputation.AccessVertices.getBackwardAccessVertices
(ContractionHierarchyPrecomputation.ContractionVertex<V> vertex) Given a contraction vertexvertex
returns its backward access verticesTransitNodeRoutingPrecomputation.AccessVertices.getForwardAccessVertices
(ContractionHierarchyPrecomputation.ContractionVertex<V> vertex) Given a contraction vertexvertex
returns its forward access verticesprivate Pair
<TransitNodeRoutingPrecomputation.AccessVertex<V, E>, TransitNodeRoutingPrecomputation.AccessVertex<V, E>> TransitNodeRoutingShortestPath.getMinWeightAccessVertices
(V source, V sink) For verticessource
andsink
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 verticessource
andsink
finds pair of access vertices with smallest weight over all pairs.Constructor parameters in org.jgrapht.alg.shortestpath with type arguments of type TransitNodeRoutingPrecomputation.AccessVertexModifierConstructorDescriptionAccessVertices
(List<List<TransitNodeRoutingPrecomputation.AccessVertex<V, E>>> forwardAccessVertices, List<List<TransitNodeRoutingPrecomputation.AccessVertex<V, E>>> backwardAccessVertices) Constructs a new instance for the givenforwardAccessVertices
andbackwardAccessVertices
.