Package com.here.platform.location.inmemory.graph
package com.here.platform.location.inmemory.graph
-
ClassDescriptionThe vertex and the segment have opposite directions.Defines an edge in the routing graph, which corresponds to a transition from one vertex to another.Represents the index of an edge inside a graph partition.Contains the edge property data for a single tile.The vertex and the segment have the same direction.Contains the routing graph data for a single tile.Contains the range-based property data for a single tile.Contains the range-based property data for a single tile.Contains the routing graph data for a single tile, needed to perform an efficient reverse expansion of a graph.The Index of an undirected road segment in a
GraphTile.TiledEdgePropertyMap<T,U> APropertyMap[Edge, T]that retrieves edge attribute values from multipleEdgePropertyTiles.ATiledEdgePropertyMapthat does not apply any transformation to the values inside theEdgePropertyTiles before returning them.Implements aPropertyMapfor retrieving vertex geometries.A Graph consisting of multipleGraphTiles.Mixin trait forTiledGraphobjects that makes queryingoutEdgeIteratororoutDegreefor a vertex whose tile is not part of the graph return empty instead of throwing.Unifies multipleOverlappingRangeBasedPropertyTiles, to enable using them transparently to look up property values byVertex.Unifies multipleRangeBasedPropertyTiles, to enable using them transparently to look up property values byVertex.ATiledRangeBasedPropertyMapthat does not apply any transformation to the values inside theRangeBasedPropertyTiles before returning them.A reverse Graph consisting of multiple tiles.A reverse Graph consisting of multipleGraphTiles.A property map for properties that do not depend on the direction of a vertex (segment properties).Contains the undirected property data for a single tile.Defines a vertexRepresents the index of a vertex inside a graph partition.Represents a continuous part of a vertex.Methods for manipulating vertex directions.