Class ReverseGraphTile

java.lang.Object
com.here.platform.location.inmemory.graph.ReverseGraphTile

public class ReverseGraphTile extends Object
Contains the routing graph data for a single tile, needed to perform an efficient reverse expansion of a graph.

param: firstIncomingEdgeIndexIndices For every vertex, the index of its first incoming edge. param: incomingEdgeIndices For every incoming edge, its index in GraphTile edges param: incomingEdgeSources For every edge, sorted the same as in GraphTile edges, the index of its source vertex param: externalEdgeTileIds For every external edge, its TileId param: externalEdgeIndices For every external edge, its index in the GraphTile edges array in the origin tile.

  • Constructor Details

    • ReverseGraphTile

      public ReverseGraphTile(TileId tileId, int[] firstIncomingEdgeIndexIndices, int[] incomingEdgeIndices, int[] incomingEdgeSources, long[] externalEdgeTileIds, int[] externalEdgeIndices)
  • Method Details

    • edgeCount

      public int edgeCount()
      The total number of internal and external edges in this GraphTile.
    • externalEdgeCount

      public int externalEdgeCount()
      The number of edges whose source vertex belong to another tile.
    • externalEdgeIndices

      public int[] externalEdgeIndices()
    • externalEdgeTileIds

      public long[] externalEdgeTileIds()
    • firstIncomingEdgeIndexIndices

      public int[] firstIncomingEdgeIndexIndices()
    • incomingEdgeIndices

      public int[] incomingEdgeIndices()
    • incomingEdgeSources

      public int[] incomingEdgeSources()
    • internalVertexCount

      public int internalVertexCount()
      The number of vertices that belong to this ReverseGraphTile.
    • isEdgeInternal

      public boolean isEdgeInternal(int edgeIndex)
      Predicate indicating if an edge index refers to an internal edge.
    • tileId

      public TileId tileId()