Packages

trait DirectedGraph[V, E] extends IncidenceGraph[V, E]

Represents a graph that allows expanding vertices to get their outgoing edges.

Linear Supertypes
IncidenceGraph[V, E], AnyRef, Any
Known Subclasses
FilteredGraph, TiledGraph, CutBorders, TiledReverseGraph, TiledReversedGraph
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. DirectedGraph
  2. IncidenceGraph
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def containsEdge(edge: E): Boolean

    Predicate asserting the presence of an edge in the graph

    Predicate asserting the presence of an edge in the graph

    Definition Classes
    IncidenceGraph
  2. abstract def containsVertex(vertex: V): Boolean

    Predicate asserting the presence of a vertex in the graph

    Predicate asserting the presence of a vertex in the graph

    Definition Classes
    IncidenceGraph
  3. abstract def edgeIterator(sourceVertex: V, targetVertex: V): Iterator[E]

    Retrieves all edges from sourceVertex to targetVertex

  4. abstract def outDegree(vertex: V): 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

  5. abstract def outEdgeIterator(vertex: V): Iterator[E]

    Retrieves outgoing edges of a vertex.

  6. abstract def source(edge: E): V

    Retrieves the source vertex of an edge.

    Retrieves the source vertex of an edge.

    returns

    The source vertex of the edge

    Definition Classes
    IncidenceGraph
  7. abstract def target(edge: E): V

    Retrieves the target vertex of an edge.

    Retrieves the target vertex of an edge.

    returns

    The target vertex of the edge

    Definition Classes
    IncidenceGraph

Concrete 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. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  7. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  8. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  9. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  10. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  11. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  12. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  13. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  14. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  15. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  16. def toString(): String
    Definition Classes
    AnyRef → Any
  17. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  18. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  19. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()

Inherited from IncidenceGraph[V, E]

Inherited from AnyRef

Inherited from Any

Ungrouped