DAG
morphir.dependency.DAG
object DAG
Generated based on Dependency.DAG
Attributes
- Graph
-
- Supertypes
-
class Objecttrait Matchableclass Any
- Self type
-
DAG.type
Members list
Type members
Classlikes
Attributes
- Supertypes
-
trait Serializabletrait Producttrait Equalsclass Objecttrait Matchableclass AnyShow all
final case class DAG[ComparableNode](arg1: Map[ComparableNode, Set[ComparableNode]]) extends AnyVal
Attributes
- Supertypes
-
trait Serializabletrait Producttrait Equalsclass AnyValtrait Matchableclass AnyShow all
Value members
Concrete methods
def backwardTopologicalOrdering[ComparableNode]: (DAG[ComparableNode]) => List[List[ComparableNode]]
def collectForwardReachableNodes[ComparableNode](firstNode: ComparableNode): (DAG[ComparableNode]) => Set[ComparableNode]
def deleteNode[ComparableNode](comparableNode: ComparableNode): (DAG[ComparableNode]) => DAG[ComparableNode]
def forwardTopologicalOrdering[ComparableNode](dag: DAG[ComparableNode]): List[List[ComparableNode]]
def incomingEdges[ComparableNode](toNode: ComparableNode): (DAG[ComparableNode]) => Set[ComparableNode]
def insertEdge[ComparableNode](from: ComparableNode)(to: ComparableNode): (DAG[ComparableNode]) => Result[CycleDetected[ComparableNode], DAG[ComparableNode]]
def insertNode[ComparableNode](fromNode: ComparableNode)(toNodes: Set[ComparableNode]): (DAG[ComparableNode]) => Result[CycleDetected[ComparableNode], DAG[ComparableNode]]
def outgoingEdges[ComparableNode](fromNode: ComparableNode): (DAG[ComparableNode]) => Set[ComparableNode]
def removeEdge[ComparableNode](from: ComparableNode)(to: ComparableNode): (DAG[ComparableNode]) => DAG[ComparableNode]
def removeIncomingEdges[ComparableNode](comparableNode: ComparableNode)(dag: DAG[ComparableNode]): DAG[ComparableNode]
def removeNode[ComparableNode](comparableNode: ComparableNode): (DAG[ComparableNode]) => DAG[ComparableNode]
Implicits
Implicits
In this article