Class TransitNodeRoutingPrecomputation.AccessVertex<V,E>

java.lang.Object
org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.AccessVertex<V,E>
Type Parameters:
V - graph vertex type
E - graph edge type
Enclosing class:
TransitNodeRoutingPrecomputation<V,E>
public static class TransitNodeRoutingPrecomputation.AccessVertex<V,E> extends 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, then vertex is the ending vertex in the path, Otherwise it is a starting vertex of the path.

  • Field Details

    • vertex

      private V vertex
      Transit vertex.

    • path

      private GraphPath<V,E> path
      Path between a vertex $v$ this access vertex is computed for and vertex.

  • Constructor Details

    • AccessVertex

      public AccessVertex(V vertex, GraphPath<V,E> path)
      Constructs a new instance for the given vertex and path.
      Parameters:
      vertex - a transit vertex
      path - path between a vertex in the graph and vertex

  • Method Details

    • getVertex

      public V getVertex()
      Returns a transit vertex of this access vertex.
      Returns:
      transit vertex of this access vertex

    • getPath

      public GraphPath<V,E> getPath()
      Returns path between a vertex in the graph and vertex.
      Returns:
      path between a vertex in the graph and vertex.