28 template<
class BAYESNET,
class GRAPH>
class EliminationTree;
51 template<
class BAYESTREE,
class GRAPH>
70 template<
class ETREE_BAYESNET,
class ETREE_GRAPH>
boost::shared_ptr< This > shared_ptr
Shared pointer to this class.
Definition: JunctionTree.h:57
Definition: JunctionTree.h:52
static This FromEliminationTree(const ETREE &eliminationTree)
Build the junction tree from an elimination tree.
Definition: JunctionTree.h:67
ClusterTree< BAYESTREE, GRAPH > Base
Our base class.
Definition: JunctionTree.h:58
JunctionTree< BAYESTREE, GRAPH > This
This class.
Definition: JunctionTree.h:56
An elimination tree is a data structure used intermediately during elimination.
Definition: EliminationTree.h:51
Collects factorgraph fragments defined on variable clusters, arranged in a tree.
A cluster-tree is associated with a factor graph and is defined as in Koller-Friedman: each node k re...
Definition: BayesTree.h:33