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