Class TransitNodeRoutingPrecomputation.AccessVerticesBuilder

java.lang.Object
org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.AccessVerticesBuilder
Enclosing class:
TransitNodeRoutingPrecomputation<V,E>

private class TransitNodeRoutingPrecomputation.AccessVerticesBuilder extends Object
Provides API to build an AccessVertices object.
  • Field Details

    • forwardAccessVertices

      private List<List<TransitNodeRoutingPrecomputation.AccessVertex<V,E>>> forwardAccessVertices
      For every vertex in contractionGraph 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 List<List<TransitNodeRoutingPrecomputation.AccessVertex<V,E>>> backwardAccessVertices
      For every vertex in contractionGraph 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.
  • Constructor Details

    • AccessVerticesBuilder

      public AccessVerticesBuilder(int numberOfVertices)
      Constructs an instance for the given numberOfVertices.
      Parameters:
      numberOfVertices - number of vertices in a m graph
  • Method Details

    • buildVertices

      Builds a new instance of AccessVertices using forwardAccessVertices and backwardAccessVertices.
      Returns:
      access vertices
    • addForwardAccessVertices

      public void addForwardAccessVertices(ContractionHierarchyPrecomputation.ContractionVertex<V> v, Set<V> vertices)
      Computes a list of forward access vertices for v using vertices and adds them to the forwardAccessVertices.
      Parameters:
      v - vertex
      vertices - transit vertices
    • addBackwardAccessVertices

      public void addBackwardAccessVertices(ContractionHierarchyPrecomputation.ContractionVertex<V> v, Set<V> vertices)
      Computes a list of backward access vertices for v using vertices and adds them to the backwardAccessVertices.
      Parameters:
      v - vertex
      vertices - transit vertices
    • getPrunedAccessVertices

      private Set<V> getPrunedAccessVertices(V v, Set<V> vertices, ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths<V,E> manyToManyShortestPaths, boolean forwardAccessVertices)
      Selects redundant access vertices from vertices.
      Parameters:
      v - vertex
      vertices - transit vertices
      manyToManyShortestPaths - transit vertices paths
      forwardAccessVertices - if vertices are forward access vertices for not wrt v
      Returns:
      redundant access vertices