Packages

final case class DLG[N, +M](nodes: Seq[N], meta: GraphMeta[N, M]) extends AbstractGraph[N, M] with DirectedAcyclicGraph[N, M] with DirectedGraphSucc[N, M] with DirectedGraphPred[N, M] with Product with Serializable

Linear Supertypes
Serializable, Product, Equals, DirectedGraphPred[N, M], DirectedGraphSucc[N, M], GraphImpl[N, M], DirectedAcyclicGraph[N, M], DirectedGraph[N, M], GraphProperty[N, M], AbstractGraph[N, M], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. DLG
  2. Serializable
  3. Product
  4. Equals
  5. DirectedGraphPred
  6. DirectedGraphSucc
  7. GraphImpl
  8. DirectedAcyclicGraph
  9. DirectedGraph
  10. GraphProperty
  11. AbstractGraph
  12. AnyRef
  13. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new DLG(nodes: Seq[N], meta: GraphMeta[N, M])

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(nodeId: N): M
    Definition Classes
    AbstractGraph
  5. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  6. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native()
  7. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  8. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  9. def get(nodeId: N): Option[M]
    Definition Classes
    AbstractGraph
  10. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  11. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  12. val meta: GraphMeta[N, M]
    Definition Classes
    DLG → AbstractGraph
  13. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  14. def noPredcessors: Set[N]
    Definition Classes
    DirectedGraphPred
  15. def noSuccessors: Set[N]
    Definition Classes
    DirectedGraphSucc
  16. val nodes: Seq[N]
  17. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  18. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  19. lazy val predecessors: AdjacencyPredList[N]
    Definition Classes
    DLG → DirectedGraphPred
  20. def productElementNames: Iterator[String]
    Definition Classes
    Product
  21. lazy val successors: AdjacencySuccList[N]
    Definition Classes
    DLG → DirectedGraphSucc
  22. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  23. def toposorted: Seq[N]
    Definition Classes
    DLG → DirectedAcyclicGraph
  24. def transposed: DirectedGraph[N, M]
    Definition Classes
    DLG → DirectedGraph
  25. def values: Iterable[M]
    Definition Classes
    AbstractGraph
  26. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  27. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  28. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from DirectedGraphPred[N, M]

Inherited from DirectedGraphSucc[N, M]

Inherited from GraphImpl[N, M]

Inherited from DirectedAcyclicGraph[N, M]

Inherited from DirectedGraph[N, M]

Inherited from GraphProperty[N, M]

Inherited from AbstractGraph[N, M]

Inherited from AnyRef

Inherited from Any

Ungrouped