Module org.jgrapht.core
Package org.jgrapht.alg.shortestpath

Class TransitNodeRoutingPrecomputation.VoronoiDiagram<V>

java.lang.Object
org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.VoronoiDiagram<V>
Type Parameters:
V - graph vertex type
Enclosing class:
TransitNodeRoutingPrecomputation<V,E>
public static class TransitNodeRoutingPrecomputation.VoronoiDiagram<V> extends Object
Voronoi diagram for a graph. Formally each cell in the diagram is defined as $Vor(v) = \{u ∈ V : ∀w ∈ T$ \ $ \{v\} : \mu(u, v) ≤ \mu(u, w)\}$, where $V$ is the vertex set, $T$ is a set of vertaccess verticesices representing Voronoi cells centers and $\mu(u,v)$ denotes distance between vertices $u$ and $v$.

  • Field Details

    • voronoiCells

      private int[] voronoiCells
      For each vertex in contractionGraph contains id of its Voronoi cell, or NO_VORONOI_CELL if it does not belong to any cell.

  • Constructor Details

    • VoronoiDiagram

      public VoronoiDiagram(int[] voronoiCells)
      Constructs a new instance for the given voronoiCells.
      Parameters:
      voronoiCells - Voronoi cells ids

  • Method Details