Class TiledReversedGraph
java.lang.Object
com.here.platform.location.inmemory.graph.TiledReversedGraph
- All Implemented Interfaces:
com.here.platform.location.core.graph.DirectedGraph<Vertex,
,Edge> com.here.platform.location.core.graph.IncidenceGraph<Vertex,
Edge>
public class TiledReversedGraph
extends Object
implements com.here.platform.location.core.graph.DirectedGraph<Vertex,Edge>
A reverse Graph consisting of multiple tiles.
The graph vertices and edges are compatible with the ones returned from the forward graph, so the two graphs can be used together in the same algorithm (e.g. bidirectional search).
- Note:
- This implementation works by exploiting a property of a specific set of directed "edge based" graphs
often used in road networks, whose vertices always have an inverse (
Vertices.invertDirection
). For a more generic implementation of a reverse tiled graph seeTiledReverseGraph
.param: tileById Used to retrieve the graph data tiles by their ID, if they exist
-
Constructor Summary
ConstructorsConstructorDescriptionTiledReversedGraph
(scala.Function1<TileId, scala.Option<GraphTile>> tileById) -
Method Summary
Modifier and TypeMethodDescriptionboolean
containsEdge
(Edge edge) boolean
containsVertex
(Vertex vertex) scala.collection.Iterator<Edge>
edgeIterator
(Vertex sourceVertex, Vertex targetVertex) int
scala.collection.Iterator<Edge>
outEdgeIterator
(Vertex vertex)
-
Constructor Details
-
TiledReversedGraph
-
-
Method Details
-
containsEdge
-
containsVertex
-
edgeIterator
-
outDegree
-
outEdgeIterator
-
source
-
target
-