Go to the documentation of this file.
   36   return marginalFactor;
 
   57   std::cout << (
s.empty() ? 
"Discrete Marginals of:" : 
s + 
" ") << std::endl;
 
  
std::pair< DiscreteConditional::shared_ptr, DiscreteFactor::shared_ptr > EliminateDiscrete(const DiscreteFactorGraph &factors, const Ordering &frontalKeys)
Main elimination function for DiscreteFactorGraph.
DiscreteFactor::shared_ptr operator()(Key variable) const
const KeyFormatter & formatter
DiscreteBayesTree::shared_ptr bayesTree_
std::function< std::string(Key)> KeyFormatter
Typedef for a function to format a key, i.e. to convert it to a string.
void print(const std::string &s="", const KeyFormatter formatter=DefaultKeyFormatter) const
Print details.
A class for computing marginals in a DiscreteFactorGraph.
const gtsam::Symbol key('X', 0)
std::shared_ptr< DiscreteFactor > shared_ptr
shared_ptr to this class
std::pair< Key, size_t > DiscreteKey
NonlinearFactorGraph graph
std::uint64_t Key
Integer nonlinear key type.
Vector marginalProbabilities(const DiscreteKey &key) const
gtsam
Author(s): 
autogenerated on Wed May 28 2025 03:01:13