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
Ordering
- Alphabetic
- By Inheritance
Inherited
- DLG
- Serializable
- Product
- Equals
- DirectedGraphPred
- DirectedGraphSucc
- GraphImpl
- DirectedAcyclicGraph
- DirectedGraph
- GraphProperty
- AbstractGraph
- AnyRef
- Any
- Hide All
- Show All
Visibility
- 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(nodeId: N): M
- Definition Classes
- AbstractGraph
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- def get(nodeId: N): Option[M]
- Definition Classes
- AbstractGraph
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- val meta: GraphMeta[N, M]
- Definition Classes
- DLG → AbstractGraph
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def noPredcessors: Set[N]
- Definition Classes
- DirectedGraphPred
- def noSuccessors: Set[N]
- Definition Classes
- DirectedGraphSucc
- val nodes: Seq[N]
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- lazy val predecessors: AdjacencyPredList[N]
- Definition Classes
- DLG → DirectedGraphPred
- def productElementNames: Iterator[String]
- Definition Classes
- Product
- lazy val successors: AdjacencySuccList[N]
- Definition Classes
- DLG → DirectedGraphSucc
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toposorted: Seq[N]
- Definition Classes
- DLG → DirectedAcyclicGraph
- def transposed: DirectedGraph[N, M]
- Definition Classes
- DLG → DirectedGraph
- def values: Iterable[M]
- Definition Classes
- AbstractGraph
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- 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()