34 friend class ::EliminationTreeTester;
68 bool equals(
const This& other,
double tol = 1e-9)
const;
A Bayes net of Gaussian Conditionals indexed by discrete keys.
Linearized Hybrid factor graph that uses type erasure.
Global functions in a separate testing namespace.
Definition chartTesting.h:28
Template to create a binary predicate.
Definition Testable.h:111
Elimination Tree type for Hybrid Factor Graphs.
Definition HybridEliminationTree.h:32
HybridEliminationTree This
This class.
Definition HybridEliminationTree.h:39
boost::shared_ptr< This > shared_ptr
Shared pointer to this class.
Definition HybridEliminationTree.h:40
EliminationTree< HybridBayesNet, HybridGaussianFactorGraph > Base
Base class.
Definition HybridEliminationTree.h:38
Definition HybridGaussianFactorGraph.h:102
An elimination tree is a data structure used intermediately during elimination.
Definition EliminationTree.h:52
The VariableIndex class computes and stores the block column structure of a factor graph.
Definition VariableIndex.h:43