JungUndirectedGraph

def != (arg0: AnyRef): Boolean

def != (arg0: Any): Boolean

def ## (): Int

def == (arg0: AnyRef): Boolean

def == (arg0: Any): Boolean

def allEdges (): Set[Edge[(), EP]]

def areNeighbors (v1: Vertex[VP], v2: Vertex[VP]): Boolean

def asInstanceOf [T0] : T0

def canEqual (arg0: Any): Boolean

def clone (): AnyRef

def connects (edge: Edge[(), EP], a1: Vertex[VP], a2: Vertex[VP]): Boolean

def degree (v: Vertex[VP]): Int

def delete (v: Vertex[VP]): JungUndirectedGraph[VP, EP]

val edgePayloadFunction : (()) ⇒ EP

def edgesTouching (v: Vertex[VP]): Set[Edge[(), EP]]

val ef : (Seq[Vertex[VP]]) ⇒ Seq[(Vertex[VP], Vertex[VP], EP)]

def eliminate (v: Vertex[VP], payload: (Vertex[VP], Vertex[VP]) ⇒ EP): JungUndirectedGraph[VP, EP]

"decompositions" page 3 (Definition 3, Section 9.

def eq (arg0: AnyRef): Boolean

def equals (arg0: Any): Boolean

def filterEdges (f: ((Vertex[VP], Vertex[VP], EP)) ⇒ Boolean): JungUndirectedGraph[VP, EP]

def finalize (): Unit

def findVertex (f: (Vertex[VP]) ⇒ Boolean): Option[Vertex[VP]]

def firstLeafOtherThan (r: Vertex[VP]): Option[Vertex[VP]]

def forceClique (among: Set[Vertex[VP]], payload: (Vertex[VP], Vertex[VP]) ⇒ EP): JungUndirectedGraph[VP, EP]

def getClass (): java.lang.Class[_]

def hashCode (): Int

def isClique (vs: GenTraversable[Vertex[VP]]): Boolean

def isInstanceOf [T0] : Boolean

lazy val jungGraph : UndirectedSparseGraph[Vertex[VP], Edge[(), EP]]

def map [NVP, NEP] (vpf: (VP) ⇒ NVP, epf: (EP) ⇒ NEP): JungUndirectedGraph[NVP, NEP]

def ne (arg0: AnyRef): Boolean

def neighbors (v: Vertex[VP]): Set[Vertex[VP]]

def notify (): Unit

def notifyAll (): Unit

def numEdgesToForceClique (vs: GenTraversable[Vertex[VP]], payload: (Vertex[VP], Vertex[VP]) ⇒ EP): Int

def other (edge: Edge[(), EP], u: Vertex[VP]): Vertex[VP]

def productArity : Int

def productElement (arg0: Int): Any

def productIterator : Iterator[Any]

def productPrefix : String

def size (): Int

def storage (): UndirectedSparseGraph[Vertex[VP], Edge[(), EP]]

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

def toString (): String

def unlink (v1: Vertex[VP], v2: Vertex[VP]): JungUndirectedGraph[VP, EP]

def unlink (e: Edge[(), EP]): JungUndirectedGraph[VP, EP]

lazy val vertexSeq : Seq[Vertex[VP]]

lazy val vertexSet : Set[Vertex[VP]]

def vertexWithFewestEdgesToEliminateAmong (among: Set[Vertex[VP]], payload: (Vertex[VP], Vertex[VP]) ⇒ EP): Vertex[VP]

def vertexWithFewestNeighborsAmong (among: Set[Vertex[VP]]): Vertex[VP]

def vertices (edge: Edge[(), EP]): (Vertex[VP], Vertex[VP])

def vertices (): Set[Vertex[VP]]

val vps : Seq[VP]

def wait (): Unit

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

def wait (arg0: Long): Unit

def productElements : Iterator[Any]