Packages

object Graphs

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Graphs
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. def apply(optimizedMap: OptimizedMapLayers): Graphs

    Creates a Graphs from an Optimized Map for Location Library.

  5. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  6. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  7. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  8. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  9. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  10. def forward(routingGraphLayer: RoutingGraphLayer): DirectedGraph[Vertex, Edge]
  11. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  12. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  13. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  14. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  15. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  16. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  17. def reverse(routingGraphLayer: RoutingGraphLayer): DirectedGraph[Vertex, Edge]
  18. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  19. def toString(): String
    Definition Classes
    AnyRef → Any
  20. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  21. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  22. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()

Deprecated Value Members

  1. def from(optimizedMap: Catalog, cacheManager: DataLoaderProvider): DirectedGraph[Vertex, Edge]

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

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

    Annotations
    @Deprecated @deprecated
    Deprecated

    (Since version SDK 2.54) Use methods based on OptimizedMapLayers instead.

  2. 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 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.

    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.

Inherited from AnyRef

Inherited from Any

Ungrouped