Graphs

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def colored[N <: GNode[N, L], L <: GLink[N]](n: N)(color: (N) ⇒ Boolean): CGL[N, L]

wrap a node and turn it into a colored graph with the given coloring function

def entire[N <: GNode[N, L], L <: GLink[N]](n: N): CGL[N, L]

wrap a node and turn it into a graph with no color (all nodes traversed)

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def filterNodes[N <: GNode[N, L], L <: GLink[N]](n: N)(f: (N) ⇒ Boolean): Seq[N]

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

var maxDebugDepth: Int

set this to > 0 to limit all recursion for debug purposes

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

implicit def toGraphLike[N <: GNode[N, L], L <: GLink[N]](root: N)(implicit mn: Manifest[N], ml: Manifest[L]): CGL[N, L]

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def foreach[N <: GNode[N, L], L <: GLink[N]](n: N, fn: (N, Int) ⇒ Unit, fl: (L, Int) ⇒ Unit, level: Int = 0): Unit

def mkString[N <: GNode[N, L], L <: GLink[N]](n: N): String

def mkString2[N <: GNode[N, L], L <: GLink[N]](n: N): String