Collaboration diagram for Discrete:
Classes | |
| class | gtsam::AlgebraicDecisionTree< L > |
| class | gtsam::Assignment< L > |
| class | gtsam::DecisionTree< L, Y > |
| a decision tree is a function from assignments to values. More... | |
| class | gtsam::DecisionTreeFactor |
| class | gtsam::DiscreteBayesNet |
| class | gtsam::DiscreteBayesTree |
| A Bayes tree representing a Discrete distribution. More... | |
| class | gtsam::DiscreteConditional |
| class | gtsam::DiscreteDistribution |
| class | gtsam::DiscreteEliminationTree |
| Elimination tree for discrete factors. More... | |
| class | gtsam::DiscreteFactor |
| class | gtsam::DiscreteFactorGraph |
| class | gtsam::DiscreteJunctionTree |
| class | gtsam::DiscreteLookupTable |
| DiscreteLookupTable table for max-product. More... | |
| class | gtsam::DiscreteMarginals |
| class | gtsam::DiscreteValues |
| class | gtsam::Signature |
| class | gtsam::TableFactor |
Typedefs | |
| using | gtsam::DiscreteKey = std::pair< Key, size_t > |
Functions | |
| std::pair< DiscreteConditional::shared_ptr, DiscreteFactor::shared_ptr > | gtsam::EliminateDiscrete (const DiscreteFactorGraph &factors, const Ordering &frontalKeys) |
| Main elimination function for DiscreteFactorGraph. More... | |
| std::pair< DiscreteConditional::shared_ptr, DiscreteFactor::shared_ptr > | gtsam::EliminateForMPE (const DiscreteFactorGraph &factors, const Ordering &frontalKeys) |
| Alternate elimination function for that creates non-normalized lookup tables. More... | |
Detailed Description
Typedef Documentation
◆ DiscreteKey
| using gtsam::DiscreteKey = typedef std::pair<Key,size_t> |
Key type for discrete variables. Includes Key and cardinality.
Definition at line 38 of file DiscreteKey.h.
Function Documentation
◆ EliminateDiscrete()
| std::pair<DiscreteConditional::shared_ptr, DiscreteFactor::shared_ptr> gtsam::EliminateDiscrete | ( | const DiscreteFactorGraph & | factors, |
| const Ordering & | frontalKeys | ||
| ) |
Main elimination function for DiscreteFactorGraph.
- Parameters
-
factors The factor graph to eliminate. frontalKeys An ordering for which variables to eliminate.
- Returns
- A pair of the resulting conditional and the separator factor.
Definition at line 219 of file DiscreteFactorGraph.cpp.
◆ EliminateForMPE()
| std::pair<DiscreteConditional::shared_ptr, DiscreteFactor::shared_ptr> gtsam::EliminateForMPE | ( | const DiscreteFactorGraph & | factors, |
| const Ordering & | frontalKeys | ||
| ) |
Alternate elimination function for that creates non-normalized lookup tables.
- Parameters
-
factors The factor graph to eliminate. frontalKeys An ordering for which variables to eliminate.
- Returns
- A pair of the resulting lookup table and the separator factor.
Definition at line 140 of file DiscreteFactorGraph.cpp.