TGraph

abstract def addNode(node: A): TGraph[A]

abstract def addTriple(triple: (A, A, A)): TGraph[A]

abstract def decomp(node: A): Option[(TContext[A], TGraph[A])]

abstract def empty: TGraph[A]

abstract def extend(ctx: TContext[A]): TGraph[A]

abstract def map[B](f: (A) ⇒ B)(implicit arg0: Manifest[B]): TGraph[B]

abstract def nodes: Set[A]

List of nodes

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def deleteNode(node: A): TGraph[A]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def foldTGraph[B](e: B)(f: (TContext[A], B) ⇒ B): B

def foldTGraphOrd[B](e: B)(f: (TContext[A], B) ⇒ B)(implicit ord: Ordering[A]): B

final def getClass(): Class[_]

def hashCode(): Int

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

def mkGraph(triples: Set[(A, A, A)]): TGraph[A]

Add a list of triples to a 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 triples: Set[(A, A, A)]

final def wait(): Unit

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

final def wait(arg0: Long): Unit