55 bool equals(
const This& other,
double tol = 1e-9)
const;
59 friend class ::EliminationTreeTester;
Chordal Bayes Net, the result of eliminating a factor graph.
Linear Factor Graph where all factors are Gaussians.
Global functions in a separate testing namespace.
Definition chartTesting.h:28
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
GaussianEliminationTree This
This class.
Definition GaussianEliminationTree.h:32
EliminationTree< GaussianBayesNet, GaussianFactorGraph > Base
Base class.
Definition GaussianEliminationTree.h:31
boost::shared_ptr< This > shared_ptr
Shared pointer to this class.
Definition GaussianEliminationTree.h:33
bool equals(const This &other, double tol=1e-9) const
Test whether the tree is equal to another.
Definition GaussianEliminationTree.cpp:39
GaussianEliminationTree(const GaussianFactorGraph &factorGraph, const VariableIndex &structure, const Ordering &order)
Build the elimination tree of a factor graph using pre-computed column structure.
Definition GaussianEliminationTree.cpp:28
A Linear Factor Graph is a factor graph where all factors are Gaussian, i.e.
Definition GaussianFactorGraph.h:75