DependantGraph

abstract def dependenciesOf(t: T): Iterable[T]

abstract def nodes: List[T]

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

lazy val allTails: List[T]

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def dependantsOf(p: T): Option[List[T]]

def depth(p: T): Option[Int]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def fanOut(p: T): Option[Int]

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def isNode(p: T): Boolean

The max of zero and 1 + depth of all parents if the node is the graph

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

def transitiveDependantsOf(p: T): List[T]

Return all dependendants of a given node.

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit