Module org.jgrapht.core
Package org.jgrapht.alg.shortestpath
Class TransitNodeRoutingPrecomputation.AccessVertex<V,E>
- java.lang.Object
-
- org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.AccessVertex<V,E>
-
- Type Parameters:
V
- graph vertex typeE
- graph edge type
- Enclosing class:
- TransitNodeRoutingPrecomputation<V,E>
public static class TransitNodeRoutingPrecomputation.AccessVertex<V,E> extends java.lang.Object
Forward or backward access vertex computed for a certain vertex $v$ in the graph.In the transit node routing if $u$ is a forward access vertex for $v$, it means that if you want go far away from $v$, it is highly likely that you would need to pass through $u$. Correspondingly, if $u$ is a backward access vertex for $v$, it means that if you want to go to $v$ from far away, you would highly likely go through $u$.
Stores transit vertex and the shortest path between $v$ and
vertex
. If this is a forward access vertex, thenvertex
is the ending vertex in thepath
, Otherwise it is a starting vertex of thepath
.
-
-
Constructor Summary
Constructors Constructor Description AccessVertex(V vertex, GraphPath<V,E> path)
Constructs a new instance for the givenvertex
andpath
.
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description GraphPath<V,E>
getPath()
Returns path between a vertex in the graph andvertex
.V
getVertex()
Returns a transit vertex of this access vertex.
-