c

BasicFactorGraph 

class BasicFactorGraph extends FactorGraph[Double]

The basic implementation of FactorGraph for Probabilistic factors in BP.

Linear Supertypes
FactorGraph[Double], AnyRef, Any
Ordering
1. Alphabetic
2. By Inheritance
Inherited
1. BasicFactorGraph
2. FactorGraph
3. AnyRef
4. Any
1. Hide All
2. Show All
Visibility
1. Public
2. All

Instance Constructors

1. new BasicFactorGraph(factors: List[Factor[Double]], semiring: Semiring[Double])

Value Members

1. final def !=(arg0: Any): Boolean
Definition Classes
AnyRef → Any
2. final def ##(): Int
Definition Classes
AnyRef → Any
3. final def ==(arg0: Any): Boolean
Definition Classes
AnyRef → Any
4. final def asInstanceOf[T0]: T0
Definition Classes
Any
5. def clone(): AnyRef
Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
6. def contains(v: Node): Boolean

Returns true if the graph contains a node for a (single) variable.

Returns true if the graph contains a node for a (single) variable.

Definition Classes
BasicFactorGraphFactorGraph
7. final def eq(arg0: AnyRef): Boolean
Definition Classes
AnyRef
8. def equals(arg0: Any): Boolean
Definition Classes
AnyRef → Any
9. def finalize(): Unit
Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
10. final def getClass(): Class[_]
Definition Classes
AnyRef → Any
11. def getFactorForNode(fn: FactorNode): Factor[Double]

Gets the factor for a particular factor node.

Gets the factor for a particular factor node.

Definition Classes
BasicFactorGraphFactorGraph
12. def getLastMessage(from: Node, to: Node): Factor[Double]

Gets the last message to a node from another.

Gets the last message to a node from another.

Definition Classes
BasicFactorGraphFactorGraph
13. def getMessagesForNode(node: Node): Iterable[(Node, Factor[Double])]

Get a list of messages from the node.

Get a list of messages from the node.

Definition Classes
BasicFactorGraphFactorGraph
14. def getNeighbors(source: Node, excluding: Node): Iterable[Node]

Returns all neighbors of a given node excluding the node of the second argument.

Returns all neighbors of a given node excluding the node of the second argument.

Definition Classes
BasicFactorGraphFactorGraph
15. def getNeighbors(source: Node): Iterable[Node]

Returns all neighbors of a given node.

Returns all neighbors of a given node.

Definition Classes
BasicFactorGraphFactorGraph
16. def getNodes(): Iterable[Node]

Returns all nodes in the factor graph.

Returns all nodes in the factor graph.

Definition Classes
BasicFactorGraphFactorGraph
17. def hashCode(): Int
Definition Classes
AnyRef → Any
18. final def isInstanceOf[T0]: Boolean
Definition Classes
Any
19. final def ne(arg0: AnyRef): Boolean
Definition Classes
AnyRef
20. final def notify(): Unit
Definition Classes
AnyRef
21. final def notifyAll(): Unit
Definition Classes
AnyRef
22. final def synchronized[T0](arg0: ⇒ T0): T0
Definition Classes
AnyRef
23. def toMutableMap(m: Map[Node, Factor[Double]]): Map[Node, Factor[Double]]
24. def toString(): String
Definition Classes
AnyRef → Any
25. def uniformFactor(v: List[Variable[_]]): Factor[Double]

Create a uniform factor to initialize the graph

Create a uniform factor to initialize the graph

Definition Classes
BasicFactorGraphFactorGraph
26. def update(from: Node, to: Node, f: Factor[Double]): FactorGraph[Double]

Updates the factor graph with a message from a node to another.

Updates the factor graph with a message from a node to another. Returns a new factor graph, which can be the same as this one.

Definition Classes
BasicFactorGraphFactorGraph
27. final def wait(): Unit
Definition Classes
AnyRef
Annotations
@throws( ... )
28. final def wait(arg0: Long, arg1: Int): Unit
Definition Classes
AnyRef
Annotations
@throws( ... )
29. final def wait(arg0: Long): Unit
Definition Classes
AnyRef
Annotations
@throws( ... )