Module org.jgrapht.core

Package org.jgrapht.alg.shortestpath

Class TransitNodeRoutingPrecomputation.TransitNodeRouting<V,E>

java.lang.Object

org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.TransitNodeRouting<V,E>

Type Parameters:

V - graph vertex type

E - graph edge type

Enclosing class:

TransitNodeRoutingPrecomputation<V,E>

static class TransitNodeRoutingPrecomputation.TransitNodeRouting<V,E>
extends java.lang.Object

This class represents return type of this algorithm and contains all data computed during the execution of the algorithm. Formally it consists of:

• ContractionHierarchyPrecomputation.ContractionHierarchy which was used to compute this transit node routing;
• set of selected transit vertices;
• ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths between transit vertices;
• TransitNodeRoutingPrecomputation.VoronoiDiagram computed using transit vertices a cell centers;
• TransitNodeRoutingPrecomputation.AccessVertices;
• TransitNodeRoutingPrecomputation.LocalityFilter.

Field Summary

Fields

Modifier and Type	Field	Description
private TransitNodeRoutingPrecomputation.AccessVertices<V,E>	accessVertices	Forward and backward access vertices for every vertex in the contraction graph.
private ContractionHierarchyPrecomputation.ContractionHierarchy<V,E>	contractionHierarchy	Contraction hierarchy based on which this transit node routing was computed.
private TransitNodeRoutingPrecomputation.LocalityFilter<V>	localityFilter	Locality filter of this transit node routing.
private java.util.Set<ContractionHierarchyPrecomputation.ContractionVertex<V>>	transitVertices	Selected transit vertices.
private ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths<V,E>	transitVerticesPaths	Paths between every pair of transit vertices.
private TransitNodeRoutingPrecomputation.VoronoiDiagram<V>	voronoiDiagram	Voronoi diagram of the graph using transitVertices as cells centers.

Constructor Summary

Constructors

Constructor

Description

TransitNodeRouting(ContractionHierarchyPrecomputation.ContractionHierarchy<V,E> contractionHierarchy, java.util.Set<ContractionHierarchyPrecomputation.ContractionVertex<V>> transitVertices, ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths<V,E> transitVerticesPaths, TransitNodeRoutingPrecomputation.VoronoiDiagram<V> voronoiDiagram, TransitNodeRoutingPrecomputation.AccessVertices<V,E> accessVertices, TransitNodeRoutingPrecomputation.LocalityFilter<V> localityFilter)

Constructs a new instance for the given contractionHierarchy, transitVertices, transitVerticesPaths, voronoiDiagram, accessVertices and localityFilter.

Method Summary

Modifier and Type	Method	Description
TransitNodeRoutingPrecomputation.AccessVertices<V,E>	getAccessVertices()	Returns access vertices of this transit node routing.
ContractionHierarchyPrecomputation.ContractionHierarchy<V,E>	getContractionHierarchy()	Returns contraction hierarchy of this transit node routing.
TransitNodeRoutingPrecomputation.LocalityFilter<V>	getLocalityFilter()	Returns locality filter of this transit node routing.
java.util.Set<ContractionHierarchyPrecomputation.ContractionVertex<V>>	getTransitVertices()	Returns transit vertices of this transit node routing.
ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths<V,E>	getTransitVerticesPaths()	Returns paths between every pair of transitVertices.
TransitNodeRoutingPrecomputation.VoronoiDiagram<V>	getVoronoiDiagram()	Returns Voronoi diagram of this transit node routing.

Methods inherited from class java.lang.Object

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

Field Detail

contractionHierarchy

private ContractionHierarchyPrecomputation.ContractionHierarchy<V,E> contractionHierarchy

Contraction hierarchy based on which this transit node routing was computed.

transitVertices

private java.util.Set<ContractionHierarchyPrecomputation.ContractionVertex<V>> transitVertices

Selected transit vertices.

transitVerticesPaths

private ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths<V,E> transitVerticesPaths

Paths between every pair of transit vertices.

voronoiDiagram

private TransitNodeRoutingPrecomputation.VoronoiDiagram<V> voronoiDiagram

Voronoi diagram of the graph using transitVertices as cells centers.

accessVertices

private TransitNodeRoutingPrecomputation.AccessVertices<V,E> accessVertices

Forward and backward access vertices for every vertex in the contraction graph.

localityFilter

private TransitNodeRoutingPrecomputation.LocalityFilter<V> localityFilter

Locality filter of this transit node routing.

Constructor Detail

TransitNodeRouting

public TransitNodeRouting(ContractionHierarchyPrecomputation.ContractionHierarchy<V,E> contractionHierarchy,
                          java.util.Set<ContractionHierarchyPrecomputation.ContractionVertex<V>> transitVertices,
                          ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths<V,E> transitVerticesPaths,
                          TransitNodeRoutingPrecomputation.VoronoiDiagram<V> voronoiDiagram,
                          TransitNodeRoutingPrecomputation.AccessVertices<V,E> accessVertices,
                          TransitNodeRoutingPrecomputation.LocalityFilter<V> localityFilter)

Constructs a new instance for the given contractionHierarchy, transitVertices, transitVerticesPaths, voronoiDiagram, accessVertices and localityFilter.

Parameters:

contractionHierarchy - contraction hierarchy

transitVertices - transit vertices

transitVerticesPaths - paths between transit vertices

voronoiDiagram - Voronoi diagram

accessVertices - access vertices

localityFilter - locality filter

Method Detail

getContractionHierarchy

public ContractionHierarchyPrecomputation.ContractionHierarchy<V,E> getContractionHierarchy()

Returns contraction hierarchy of this transit node routing.

Returns:

contraction hierarchy of this transit node routing

getTransitVertices

public java.util.Set<ContractionHierarchyPrecomputation.ContractionVertex<V>> getTransitVertices()

Returns transit vertices of this transit node routing.

Returns:

transit vertices of this transit node routing

getTransitVerticesPaths

public ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths<V,E> getTransitVerticesPaths()

Returns paths between every pair of transitVertices.

Returns:

paths between every pair of transitVertices

getVoronoiDiagram

public TransitNodeRoutingPrecomputation.VoronoiDiagram<V> getVoronoiDiagram()

Returns Voronoi diagram of this transit node routing.

Returns:

Voronoi diagram of this transit node routing

getAccessVertices

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

Returns access vertices of this transit node routing.

Returns:

access vertices of this transit node routing

getLocalityFilter

public TransitNodeRoutingPrecomputation.LocalityFilter<V> getLocalityFilter()

Returns locality filter of this transit node routing.

Returns:

locality filter of this transit node routing