Module org.jgrapht.core

Package org.jgrapht.alg.shortestpath

Class TransitNodeRoutingPrecomputation.AccessVerticesBuilder

java.lang.Object

org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.AccessVerticesBuilder

Enclosing class:

TransitNodeRoutingPrecomputation<V,E>

private class TransitNodeRoutingPrecomputation.AccessVerticesBuilder
extends java.lang.Object

Provides API to build an AccessVertices object.

Field Summary

Fields

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

Constructor Summary

Constructors

Constructor	Description
AccessVerticesBuilder(int numberOfVertices)	Constructs an instance for the given numberOfVertices.

Method Summary

Modifier and Type	Method	Description
void	addBackwardAccessVertices(ContractionHierarchyPrecomputation.ContractionVertex<V> v, java.util.Set<V> vertices)	Computes a list of backward access vertices for v using vertices and adds them to the backwardAccessVertices.
void	addForwardAccessVertices(ContractionHierarchyPrecomputation.ContractionVertex<V> v, java.util.Set<V> vertices)	Computes a list of forward access vertices for v using vertices and adds them to the forwardAccessVertices.
TransitNodeRoutingPrecomputation.AccessVertices<V,E>	buildVertices()	Builds a new instance of AccessVertices using forwardAccessVertices and backwardAccessVertices.
private java.util.Set<V>	getPrunedAccessVertices(V v, java.util.Set<V> vertices, ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths<V,E> manyToManyShortestPaths, boolean forwardAccessVertices)	Selects redundant access vertices from vertices.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

forwardAccessVertices

private java.util.List<java.util.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 java.util.List<java.util.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 Detail

AccessVerticesBuilder

public AccessVerticesBuilder(int numberOfVertices)

Constructs an instance for the given numberOfVertices.

Parameters:

numberOfVertices - number of vertices in a m graph

Method Detail

buildVertices

public TransitNodeRoutingPrecomputation.AccessVertices<V,E> buildVertices()

Builds a new instance of AccessVertices using forwardAccessVertices and backwardAccessVertices.

Returns:

access vertices

addForwardAccessVertices

public void addForwardAccessVertices(ContractionHierarchyPrecomputation.ContractionVertex<V> v,
                                     java.util.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,
                                      java.util.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 java.util.Set<V> getPrunedAccessVertices(V v,
                                                 java.util.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