Collaboration diagram for Discrete:

Classes
class	gtsam::AlgebraicDecisionTree< L >

class	gtsam::Assignment< L >

class	gtsam::DecisionTree< L, Y >

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-productInherits from discrete conditional for convenience, but is not normalized. Is used in the max-product algorithm. More...

class	gtsam::DiscreteMarginals

class	gtsam::DiscreteValues

class	gtsam::Signature

Typedefs
using	gtsam::DiscreteKey = std::pair< Key, size_t >

Functions
GTSAM_EXPORT std::pair< std::shared_ptr< DiscreteConditional >, DecisionTreeFactor::shared_ptr >	gtsam::EliminateDiscrete (const DiscreteFactorGraph &factors, const Ordering &keys)
	Main elimination function for DiscreteFactorGraph. More...

Detailed Description

Typedef Documentation

using gtsam::DiscreteKey = typedef std::pair<Key,size_t>

Key type for discrete variables. Includes Key and cardinality.

GTSAM_EXPORT std::pair<std::shared_ptr<DiscreteConditional>, DecisionTreeFactor::shared_ptr> gtsam::EliminateDiscrete	(	const DiscreteFactorGraph &	factors,
		const Ordering &	keys
	)

Main elimination function for DiscreteFactorGraph.

Parameters

factors
keys