class
JoinTree
extends JungUndirectedGraph[Set[axle.stats.RandomVariable[_]], String]
Instance Constructors
-
new
JoinTree
()
Type Members
-
-
trait
GraphEdge
[P]
extends AnyRef
-
trait
GraphVertex
[P]
extends AnyRef
-
-
-
-
-
type
S
= UndirectedSparseGraph[V, E]
-
-
-
Value Members
-
def
!=
(arg0: AnyRef): Boolean
-
def
!=
(arg0: Any): Boolean
-
def
##
(): Int
-
def
++=
(vps: Seq[Set[axle.stats.RandomVariable[_]]]): Seq[V]
-
def
+=
(vp: Set[axle.stats.RandomVariable[_]]): V
-
def
+=
(vs: (V, V), ep: String): E
-
def
==
(arg0: AnyRef): Boolean
-
def
==
(arg0: Any): Boolean
-
def
areNeighbors
(v1: V, v2: V): Boolean
-
def
asInstanceOf
[T0]
: T0
-
def
clone
(): AnyRef
-
def
degree
(v: V): Int
-
def
delete
(v: V): Unit
-
def
edge
(v1: V, v2: V, payload: String): JungUndirectedGraphEdge[String]
-
def
edges
(v: V): Set[E]
-
def
edges
(): Set[E]
-
def
eliminate
(vs: List[V], payload: (V, V) ⇒ String): Unit
-
def
eliminate
(v: V, payload: (V, V) ⇒ String): Unit
-
def
eq
(arg0: AnyRef): Boolean
-
def
equals
(arg0: Any): Boolean
-
def
finalize
(): Unit
-
def
findVertex
(payload: Set[axle.stats.RandomVariable[_]]): Option[V]
-
def
firstLeafOtherThan
(r: V): Option[V]
-
def
forceClique
(vs: Set[V], payload: (V, V) ⇒ String): Unit
-
def
getClass
(): java.lang.Class[_]
-
def
hashCode
(): Int
-
def
isClique
(vs: Set[V]): Boolean
-
def
isInstanceOf
[T0]
: Boolean
-
val
jungGraph
: UndirectedSparseGraph[V, E]
-
def
ne
(arg0: AnyRef): Boolean
-
def
neighbors
(v: V): Set[V]
-
def
notify
(): Unit
-
def
notifyAll
(): Unit
-
def
numEdgesToForceClique
(vs: Set[V], payload: (V, V) ⇒ String): Int
-
def
size
(): Int
-
def
storage
(): UndirectedSparseGraph[V, E]
-
def
synchronized
[T0]
(arg0: ⇒ T0): T0
-
def
toString
(): String
-
def
unlink
(v1: V, v2: V): Unit
-
def
unlink
(e: E): Unit
-
def
vertex
(payload: Set[axle.stats.RandomVariable[_]]): JungUndirectedGraphVertex[Set[axle.stats.RandomVariable[_]]]
-
def
vertexWithFewestEdgesToEliminateAmong
(among: Set[V], payload: (V, V) ⇒ String): V
-
def
vertexWithFewestNeighborsAmong
(among: Set[V]): V
-
def
vertices
(): Set[V]
-
def
wait
(): Unit
-
def
wait
(arg0: Long, arg1: Int): Unit
-
def
wait
(arg0: Long): Unit
Inherited from Graph[Set[axle.stats.RandomVariable[_]], String]
Inherited from AnyRef
Inherited from Any