Instance Constructors
-
new
CausalModel
(_name: String)
Type Members
-
-
-
-
trait
GraphEdge
[P]
extends AnyRef
-
trait
GraphVertex
[P]
extends AnyRef
-
-
-
-
-
type
S
= DirectedSparseGraph[V, E]
-
Value Members
-
def
!=
(arg0: AnyRef): Boolean
-
def
!=
(arg0: Any): Boolean
-
def
##
(): Int
-
-
-
def
+=
(vs: (V, V), ep: String): E
-
def
==
(arg0: AnyRef): Boolean
-
def
==
(arg0: Any): Boolean
-
def
_ancestors
(v: V, result: Set[V]): Unit
-
def
_descendants
(v: V, result: Set[V]): Unit
-
def
_findOpenPath
(visited: Map[axle.stats.RandomVariable[_], Set[axle.stats.RandomVariable[_]]], priorDirection: Int, prior: axle.stats.RandomVariable[_], current: Set[axle.stats.RandomVariable[_]], to: Set[axle.stats.RandomVariable[_]], given: Set[axle.stats.RandomVariable[_]]): Option[List[axle.stats.RandomVariable[_]]]
-
def
addFunction
(pf: PFunction): Unit
-
def
ancestors
(vs: Set[V]): Set[V]
-
def
ancestors
(v: V): Set[V]
-
def
asInstanceOf
[T0]
: T0
-
def
blocks
(from: Set[axle.stats.RandomVariable[_]], to: Set[axle.stats.RandomVariable[_]], given: Set[axle.stats.RandomVariable[_]]): Boolean
-
def
clone
(): AnyRef
-
def
deleteEdge
(e: E): Unit
-
def
deleteVertex
(v: V): Unit
-
def
descendants
(v: V): Set[V]
-
def
descendantsIntersectsSet
(v: V, s: Set[V]): Boolean
-
-
def
edge
(source: V, dest: V, payload: String): E
-
def
edges
(): Set[E]
-
def
eq
(arg0: AnyRef): Boolean
-
def
equals
(arg0: Any): Boolean
-
def
finalize
(): Unit
-
def
findEdge
(from: V, to: V): Option[E]
-
def
findVertex
(test: (CausalModelNode) ⇒ Boolean): Option[V]
-
def
getClass
(): java.lang.Class[_]
-
def
getVariable
(name: String): Int
-
def
hashCode
(): Int
-
def
isAcyclic
(): Boolean
-
def
isInstanceOf
[T0]
: Boolean
-
def
isLeaf
(v: V): Boolean
-
val
jungGraph
: DirectedSparseGraph[V, E]
-
def
leaves
(): Set[V]
-
def
moralGraph
(): axle.graph.JungUndirectedGraphFactory.UndirectedGraph[_, _]
-
def
name
(): String
-
val
name2variable
: Map[String, axle.stats.RandomVariable[_]]
-
def
ne
(arg0: AnyRef): Boolean
-
def
neighbors
(v: V): Set[V]
-
var
newVarIndex
: Int
-
def
nodeFor
(rv: axle.stats.RandomVariable[_]): V
-
def
nodesFor
(rvs: Set[axle.stats.RandomVariable[_]]): Set[V]
-
def
notify
(): Unit
-
def
notifyAll
(): Unit
-
def
numVariables
(): Int
-
def
observes
(rv: axle.stats.RandomVariable[_]): Boolean
-
def
outputEdgesOf
(v: V): Set[E]
-
def
precedes
(v1: V, v2: V): Boolean
-
def
predecessors
(v: V): Set[V]
-
def
randomVariables
(): List[axle.stats.RandomVariable[_]]
-
def
removeAllEdgesAndVertices
(): Unit
-
def
removeInputs
(vs: Set[V]): Unit
-
def
removeOutputs
(vs: Set[V]): Unit
-
def
removePredecessor
(v: V, predecessor: V): Unit
-
def
removeSuccessor
(v: V, successor: V): Unit
-
def
shortestPath
(source: V, goal: V): Option[List[E]]
-
def
size
(): Int
-
def
storage
(): DirectedSparseGraph[V, E]
-
def
successors
(v: V): Set[V]
-
def
synchronized
[T0]
(arg0: ⇒ T0): T0
-
def
toString
(): String
-
def
variable
(name: String): axle.stats.RandomVariable[_]
-
-
def
vertexPayloadToRandomVariable
(cmn: CausalModelNode): axle.stats.RandomVariable[_]
-
def
vertexToVisualizationHtml
(vp: CausalModelNode): Node
-
def
vertices
(): Set[V]
-
def
wait
(): Unit
-
def
wait
(arg0: Long, arg1: Int): Unit
-
def
wait
(arg0: Long): Unit
Inherited from AnyRef
Inherited from Any