object Graphs
- Alphabetic
- By Inheritance
- Graphs
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def apply(optimizedMap: OptimizedMapLayers): Graphs
Creates a Graphs from an Optimized Map for Location Library.
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @IntrinsicCandidate() @native()
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def forward(routingGraphLayer: RoutingGraphLayer): DirectedGraph[Vertex, Edge]
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @IntrinsicCandidate() @native()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @IntrinsicCandidate() @native()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @IntrinsicCandidate() @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @IntrinsicCandidate() @native()
- def reverse(routingGraphLayer: RoutingGraphLayer): DirectedGraph[Vertex, Edge]
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
Deprecated Value Members
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated
(Since version 9)
- def from(optimizedMap: Catalog, cacheManager: DataLoaderProvider): DirectedGraph[Vertex, Edge]
Creates a DirectedGraph that lazily loads data from the
routinggraphlayer of the Optimized Map for Location Library.Creates a DirectedGraph that lazily loads data from the
routinggraphlayer of the Optimized Map for Location Library.- Annotations
- @Deprecated @deprecated
- Deprecated
(Since version SDK 2.54) Use methods based on OptimizedMapLayers instead.
- def reversedFrom(optimizedMap: Catalog, cacheManager: DataLoaderProvider): DirectedGraph[Vertex, Edge]
Creates the reversed DirectedGraph which allows to navigate the topology backwards by flipping all edges.
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.outEdgeIterator method applied to a Vertex
A, returns the edges that haveAas 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.
- Annotations
- @Deprecated @deprecated
- Deprecated
(Since version SDK 2.54) Use methods based on OptimizedMapLayers instead.
- Note
The reversed graph is not offering the same performance as the forward graph.