DLG

izumi.fundamentals.graphs.DLG
See theDLG companion object
final case class DLG[N, +M](nodes: Seq[N], meta: GraphMeta[N, M]) extends AbstractGraph[N, M], DirectedAcyclicGraph[N, M], DirectedGraphSucc[N, M], DirectedGraphPred[N, M]

Attributes

Companion
object
Graph
Supertypes
trait Serializable
trait Product
trait Equals
trait DirectedGraphPred[N, M]
trait DirectedGraphSucc[N, M]
trait GraphImpl[N, M]
trait DirectedAcyclicGraph[N, M]
trait DirectedGraph[N, M]
trait GraphProperty[N, M]
trait AbstractGraph[N, M]
class Object
trait Matchable
class Any
Show all

Members list

Value members

Concrete methods

override def toposorted: Seq[N]

Attributes

Definition Classes
override def transposed: DirectedGraph[N, M]

Attributes

Definition Classes

Inherited methods

def apply(nodeId: N): M

Attributes

Inherited from:
AbstractGraph
def get(nodeId: N): Option[M]

Attributes

Inherited from:
AbstractGraph
def noPredcessors: Set[N]

Attributes

Inherited from:
DirectedGraphPred
def noSuccessors: Set[N]

Attributes

Inherited from:
DirectedGraphSucc
def productElementNames: Iterator[String]

An iterator over the names of all the elements of this product.

An iterator over the names of all the elements of this product.

Attributes

Inherited from:
Product
def productIterator: Iterator[Any]

An iterator over all the elements of this product.

An iterator over all the elements of this product.

Attributes

Returns

in the default implementation, an Iterator[Any]

Inherited from:
Product
def values: Iterable[M]

Attributes

Inherited from:
AbstractGraph

Concrete fields

lazy override val predecessors: AdjacencyPredList[N]
lazy override val successors: AdjacencySuccList[N]