DAG

io.github.quafadas.spireAD.DAG
class DAG[T]

Attributes

Graph
Supertypes
class Object
trait Matchable
class Any

Members list

Value members

Concrete methods

inline def addAdNode(adNode: AdNode[T]): Unit
inline def addBinaryEdge[T : Field](left: Tej[T], right: Tej[T], to: TejOpBinary[T]): Unit
inline def addEdge[T](from: AdNode[T], to: AdNode[T]): Unit
inline def addNode(adNode: AdNode[T]): Unit
inline def addOpNodeUrnary(op: UrnaryOps, t: Tej[T], dep: UUID): Unit
inline def addSedge[T](from: String, to: String): Unit
inline def addStringNode(str: String): Unit
inline def addTedge(from: Tej[T], to: Tej[T]): Unit
inline def addTejNode(tej: Tej[T]): Unit
inline def addUrnaryEdge[T : Field](from: Tej[T], to: TejOpUrnary[T]): Unit
inline def getAllEdges: Set[(AdNode[T], AdNode[T])]
inline def getAllNodes: Set[AdNode[T]]
inline def getNode(id: UUID): AdNode[T]
inline def hasEdge(from: AdNode[T], to: AdNode[T]): Boolean
inline def isEmpty: Boolean
inline def neighbors(adNode: AdNode[T]): Set[AdNode[T]]
inline def removeEdge(from: AdNode[T], to: AdNode[T]): Unit
inline def removeNode(adNode: AdNode[T]): Unit
inline def removeSedge(from: String, to: String): Unit
inline def toGraphviz: String
inline def toposort: List[AdNode[T]]