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
DiscreteEliminationTree This
This class.
Definition DiscreteEliminationTree.h:36
bool equals(const This &other, double tol=1e-9) const
Test whether the tree is equal to another.
Definition DiscreteEliminationTree.cpp:39
DiscreteEliminationTree(const DiscreteFactorGraph &factorGraph, const VariableIndex &structure, const Ordering &order)
Build the elimination tree of a factor graph using pre-computed column structure.
Definition DiscreteEliminationTree.cpp:28
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:101
EliminationTree(const FactorGraphType &factorGraph, const VariableIndex &structure, const Ordering &order)
The VariableIndex class computes and stores the block column structure of a factor graph.
Definition VariableIndex.h:43