55 bool equals(
const This& other,
double tol = 1e-9)
const;
59 friend class ::EliminationTreeTester;
boost::shared_ptr< This > shared_ptr
Shared pointer to this class.
Definition: DiscreteEliminationTree.h:33
A Discrete Factor Graph is a factor graph where all factors are Discrete, i.e.
Definition: DiscreteFactorGraph.h:65
EliminationTree< DiscreteBayesNet, DiscreteFactorGraph > Base
Base class.
Definition: DiscreteEliminationTree.h:31
Template to create a binary predicate.
Definition: Testable.h:110
The VariableIndex class computes and stores the block column structure of a factor graph.
Definition: VariableIndex.h:43
An elimination tree is a data structure used intermediately during elimination.
Definition: EliminationTree.h:51
Definition: DiscreteEliminationTree.h:27
DiscreteEliminationTree This
This class.
Definition: DiscreteEliminationTree.h:32
Global functions in a separate testing namespace.
Definition: chartTesting.h:28
Definition: Ordering.h:34