Package com.here.platform.location.integration.optimizedmap.graph.javadsl

Class Graphs

java.lang.Object

com.here.platform.location.integration.optimizedmap.graph.javadsl.Graphs

public class Graphs
extends Object

Constructor Summary

Constructors

Constructor	Description
Graphs(OptimizedMapLayers optimizedMap)	Creates a Graphs from an Optimized Map for Location Library.

Method Summary

Modifier and Type	Method	Description
DirectedGraph<Vertex,Edge>	forward()	Creates a DirectedGraph that lazily loads data from the `routinggraph` layer of the Optimized Map for Location Library using OptimizedMapLayers.routingGraph().
static DirectedGraph<Vertex,Edge>	forward(RoutingGraphLayer routingGraphLayer)
static DirectedGraph<Vertex,Edge>	from(Catalog optimizedMap, DataLoaderProvider cacheManager)	Deprecated. Prefer new Graphs(optimizedMap).forward().
DirectedGraph<Vertex,Edge>	reverse()	Creates the reversed DirectedGraph which allows to navigate the topology backwards by flipping all edges.
static DirectedGraph<Vertex,Edge>	reverse(RoutingGraphLayer routingGraphLayer)
static DirectedGraph<Vertex,Edge>	reversedFrom(Catalog optimizedMap, DataLoaderProvider cacheManager)	Deprecated. Prefer new Graphs(optimizedMap).reverse().

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Graphs

public Graphs(OptimizedMapLayers optimizedMap)

Creates a Graphs from an Optimized Map for Location Library.

Method Details

forward

public DirectedGraph<Vertex,Edge> forward()

Creates a DirectedGraph that lazily loads data from the `routinggraph` layer of the Optimized Map for Location Library using OptimizedMapLayers.routingGraph().

reverse

public DirectedGraph<Vertex,Edge> reverse()

Creates the reversed DirectedGraph which allows to navigate the topology backwards by flipping all edges.

A reversed graph is a DirectedGraph in which the DirectedGraph.getOutEdgeIterator(V) method applied to a Vertex `A`, returns the edges that have `A` as a target in the forward graph.

The returned vertices and edges are the same as the one returned from the forward graph and can be used directly to query vertex and edge PropertyMaps.

The reversed graph is not offering the same performance as the forward graph.

from

@Deprecated
public static DirectedGraph<Vertex,Edge> from(Catalog optimizedMap,
 DataLoaderProvider cacheManager)

Deprecated.

Prefer new Graphs(optimizedMap).forward().

Creates a DirectedGraph that lazily loads data from the `routinggraph` layer of the Optimized Map for Location Library.

reversedFrom

@Deprecated
public static DirectedGraph<Vertex,Edge> reversedFrom(Catalog optimizedMap,
 DataLoaderProvider cacheManager)

Deprecated.

Prefer new Graphs(optimizedMap).reverse().

Creates the reversed DirectedGraph which allows to navigate the topology backwards by flipping all edges.

A reversed graph is a DirectedGraph in which the DirectedGraph.getOutEdgeIterator(V) method applied to a Vertex `A`, returns the edges that have `A` as a target in the forward graph.

The returned vertices and edges are the same as the one returned from the forward graph and can be used directly to query vertex and edge PropertyMaps.

The reversed graph is not offering the same performance as the forward graph.

forward

public static DirectedGraph<Vertex,Edge> forward(RoutingGraphLayer routingGraphLayer)

reverse

public static DirectedGraph<Vertex,Edge> reverse(RoutingGraphLayer routingGraphLayer)