#include <gtsam/discrete/DecisionTreeFactor.h>
#include <gtsam/discrete/DiscreteLookupDAG.h>
#include <gtsam/inference/EliminateableFactorGraph.h>
#include <gtsam/inference/FactorGraph.h>
#include <gtsam/inference/Ordering.h>
#include <gtsam/base/FastSet.h>
#include <string>
#include <utility>
#include <vector>
Go to the source code of this file.
Classes | |
class | gtsam::DiscreteFactorGraph |
struct | gtsam::EliminationTraits< DiscreteFactorGraph > |
struct | gtsam::traits< DiscreteFactorGraph > |
traits More... | |
Namespaces | |
gtsam | |
traits | |
Functions | |
std::pair< DiscreteConditional::shared_ptr, DecisionTreeFactor::shared_ptr > | gtsam::EliminateDiscrete (const DiscreteFactorGraph &factors, const Ordering &frontalKeys) |
Main elimination function for DiscreteFactorGraph. More... | |
std::pair< DiscreteConditional::shared_ptr, DecisionTreeFactor::shared_ptr > | gtsam::EliminateForMPE (const DiscreteFactorGraph &factors, const Ordering &frontalKeys) |
Alternate elimination function for that creates non-normalized lookup tables. More... | |
Definition in file DiscreteFactorGraph.h.