Class TransitNodeRoutingPrecomputation.VoronoiDiagramComputation

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

private class TransitNodeRoutingPrecomputation.VoronoiDiagramComputation extends Object
Algorithm which computes Voronoi diagram for the contractionGraph. It uses transitVertices as Voronoi cells centers. To build the diagram runs a Dijkstra`s algorithm with multiple sources on a reversed graph. Uses Voronoi cells centers as initial sources. During the computations for each vertex maintains distance to the closest cell center as well as the id if this cell center.