class TiledReversedGraph extends 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 see TiledReverseGraph.

Linear Supertypes
DirectedGraph[Vertex, Edge], IncidenceGraph[Vertex, Edge], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. TiledReversedGraph
  2. DirectedGraph
  3. IncidenceGraph
  4. AnyRef
  5. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new TiledReversedGraph(tileById: (TileId) ⇒ Option[GraphTile])

    tileById

    Used to retrieve the graph data tiles by their ID, if they exist

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. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  6. def containsEdge(edge: Edge): Boolean

    Predicate asserting the presence of an edge in the graph

    Predicate asserting the presence of an edge in the graph

    Definition Classes
    TiledReversedGraph → IncidenceGraph
  7. def containsVertex(vertex: Vertex): Boolean

    Predicate asserting the presence of a vertex in the graph

    Predicate asserting the presence of a vertex in the graph

    Definition Classes
    TiledReversedGraph → IncidenceGraph
  8. def edgeIterator(sourceVertex: Vertex, targetVertex: Vertex): Iterator[Edge]

    Retrieves all edges from sourceVertex to targetVertex

    Retrieves all edges from sourceVertex to targetVertex

    Definition Classes
    TiledReversedGraph → DirectedGraph
  9. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  10. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  11. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  12. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  13. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  14. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  15. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  16. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  17. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  18. def outDegree(vertex: Vertex): Int

    Retrieves the number of outgoing edges of a vertex.

    Retrieves the number of outgoing edges of a vertex.

    returns

    The number of outgoing edges of a vertex

    Definition Classes
    TiledReversedGraph → DirectedGraph
  19. def outEdgeIterator(vertex: Vertex): Iterator[Edge]

    Retrieves outgoing edges of a vertex.

    Retrieves outgoing edges of a vertex.

    Definition Classes
    TiledReversedGraph → DirectedGraph
  20. def source(edge: Edge): Vertex

    Retrieves the source vertex of an edge.

    Retrieves the source vertex of an edge.

    returns

    The source vertex of the edge

    Definition Classes
    TiledReversedGraph → IncidenceGraph
  21. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  22. def target(edge: Edge): Vertex

    Retrieves the target vertex of an edge.

    Retrieves the target vertex of an edge.

    returns

    The target vertex of the edge

    Definition Classes
    TiledReversedGraph → IncidenceGraph
  23. val tileById: (TileId) ⇒ Option[GraphTile]
    Attributes
    protected
  24. def toString(): String
    Definition Classes
    AnyRef → Any
  25. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  26. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  27. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()

Inherited from DirectedGraph[Vertex, Edge]

Inherited from IncidenceGraph[Vertex, Edge]

Inherited from AnyRef

Inherited from Any

Ungrouped