34 friend class ::EliminationTreeTester;
69 bool equals(
const This& other,
double tol = 1e-9)
const;
Linearized Hybrid factor graph that uses type erasure.
A Bayes net of Gaussian Conditionals indexed by discrete keys.
Global functions in a separate testing namespace.
Definition chartTesting.h:28
bool equals(const This &other, double tol=1e-9) const
Test whether the tree is equal to another.
Definition HybridEliminationTree.cpp:38
HybridEliminationTree This
This class.
Definition HybridEliminationTree.h:39
std::shared_ptr< This > shared_ptr
Shared pointer to this class.
Definition HybridEliminationTree.h:40
HybridEliminationTree(const HybridGaussianFactorGraph &factorGraph, const VariableIndex &structure, const Ordering &order)
Construct the elimination tree of a factor graph using pre-computed column structure.
Definition HybridEliminationTree.cpp:27
EliminationTree< HybridBayesNet, HybridGaussianFactorGraph > Base
Base class.
Definition HybridEliminationTree.h:38
Definition HybridGaussianFactorGraph.h:107
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:41