37 DiscreteBayesTree::shared_ptr bayesTree_;
55 return marginalFactor;
68 Vector vResult(key.second);
69 for (
size_t state = 0; state < key.second ; ++ state) {
71 values[key.first] = state;
72 vResult(state) = (*marginalFactor)(values);
DiscreteFactor::shared_ptr operator()(Key variable) const
Definition: DiscreteMarginals.h:51
DiscreteMarginals(const DiscreteFactorGraph &graph)
Definition: DiscreteMarginals.h:46
Vector marginalProbabilities(const DiscreteKey &key) const
Definition: DiscreteMarginals.h:62
Discrete Bayes Tree, the result of eliminating a DiscreteJunctionTree.
Definition: DiscreteValues.h:34
std::shared_ptr< DiscreteFactor > shared_ptr
shared_ptr to this class
Definition: DiscreteFactor.h:44
Definition: DiscreteMarginals.h:33
Definition: chartTesting.h:28
typedef and functions to augment Eigen's VectorXd
Definition: DiscreteFactorGraph.h:83
GTSAM_EXPORT std::pair< std::shared_ptr< DiscreteConditional >, DecisionTreeFactor::shared_ptr > EliminateDiscrete(const DiscreteFactorGraph &factors, const Ordering &keys)
Main elimination function for DiscreteFactorGraph.
std::pair< Key, size_t > DiscreteKey
Definition: DiscreteKey.h:38
std::shared_ptr< BayesTreeType > eliminateMultifrontal(OptionalOrderingType orderingType={}, const Eliminate &function=EliminationTraitsType::DefaultEliminate, OptionalVariableIndex variableIndex={}) const
Definition: EliminateableFactorGraph-inst.h:88
std::uint64_t Key
Integer nonlinear key type.
Definition: types.h:102