#include <DiscreteJunctionTree.h>

Inheritance diagram for gtsam::DiscreteJunctionTree:

Public Types
typedef JunctionTree< DiscreteBayesTree, DiscreteFactorGraph >	Base
	Base class. More...

typedef std::shared_ptr< This >	shared_ptr
	Shared pointer to this class. More...

typedef DiscreteJunctionTree	This
	This class. More...

Public Types inherited from gtsam::JunctionTree< DiscreteBayesTree, DiscreteFactorGraph >
typedef EliminatableClusterTree< DiscreteBayesTree, DiscreteFactorGraph >	Base
	Our base class. More...

typedef std::shared_ptr< This >	shared_ptr
	Shared pointer to this class. More...

typedef JunctionTree< DiscreteBayesTree, DiscreteFactorGraph >	This
	This class. More...

Public Types inherited from gtsam::EliminatableClusterTree< DiscreteBayesTree, DiscreteFactorGraph >
typedef DiscreteBayesTree	BayesTreeType
	The BayesTree type produced by elimination. More...

typedef DiscreteBayesTree ::ConditionalType	ConditionalType
	The type of conditionals. More...

typedef DiscreteFactorGraph ::Eliminate	Eliminate
	Typedef for an eliminate subroutine. More...

typedef DiscreteFactorGraph	FactorGraphType
	The factor graph type. More...

typedef DiscreteFactorGraph ::FactorType	FactorType
	The type of factors. More...

typedef std::shared_ptr< This >	shared_ptr
	Shared pointer to this class. More...

typedef std::shared_ptr< ConditionalType >	sharedConditional
	Shared pointer to a conditional. More...

typedef std::shared_ptr< FactorType >	sharedFactor
	Shared pointer to a factor. More...

typedef EliminatableClusterTree< DiscreteBayesTree, DiscreteFactorGraph >	This
	This class. More...

Constructors
	DiscreteJunctionTree (const DiscreteEliminationTree &eliminationTree)

Testable
void	print (const std::string &name="DiscreteJunctionTree: ", const KeyFormatter &formatter=DefaultKeyFormatter) const

Additional Inherited Members
Public Member Functions inherited from gtsam::EliminatableClusterTree< DiscreteBayesTree, DiscreteFactorGraph >
std::pair< std::shared_ptr< BayesTreeType >, std::shared_ptr< FactorGraphType > >	eliminate (const Eliminate &function) const

const FastVector< sharedFactor > &	remainingFactors () const

Protected Member Functions inherited from gtsam::JunctionTree< DiscreteBayesTree, DiscreteFactorGraph >
	JunctionTree ()

	JunctionTree (const EliminationTree< ETREE_BAYESNET, ETREE_GRAPH > &eliminationTree)

Protected Member Functions inherited from gtsam::EliminatableClusterTree< DiscreteBayesTree, DiscreteFactorGraph >
	EliminatableClusterTree (const This &other)

	EliminatableClusterTree ()
	Default constructor to be used in derived classes. More...

This &	operator= (const This &other)

Static Protected Member Functions inherited from gtsam::JunctionTree< DiscreteBayesTree, DiscreteFactorGraph >
static This	FromEliminationTree (const ETREE &eliminationTree)

Protected Attributes inherited from gtsam::EliminatableClusterTree< DiscreteBayesTree, DiscreteFactorGraph >
FastVector< sharedFactor >	remainingFactors_

Detailed Description

An EliminatableClusterTree, i.e., a set of variable clusters with factors, arranged in a tree, with the additional property that it represents the clique tree associated with a Bayes net.

In GTSAM a junction tree is an intermediate data structure in multifrontal variable elimination. Each node is a cluster of factors, along with a clique of variables that are eliminated all at once. In detail, every node k represents a clique (maximal fully connected subset) of an associated chordal graph, such as a chordal Bayes net resulting from elimination.

The difference with the BayesTree is that a JunctionTree stores factors, whereas a BayesTree stores conditionals, that are the product of eliminating the factors in the corresponding JunctionTree cliques.

The tree structure and elimination method are exactly analogous to the EliminationTree, except that in the JunctionTree, at each node multiple variables are eliminated at a time.

Definition at line 53 of file DiscreteJunctionTree.h.

Member Typedef Documentation

◆ Base

typedef JunctionTree<DiscreteBayesTree, DiscreteFactorGraph> gtsam::DiscreteJunctionTree::Base

Base class.

Definition at line 57 of file DiscreteJunctionTree.h.

◆ shared_ptr

typedef std::shared_ptr<This> gtsam::DiscreteJunctionTree::shared_ptr

Shared pointer to this class.

Definition at line 59 of file DiscreteJunctionTree.h.

◆ This

typedef DiscreteJunctionTree gtsam::DiscreteJunctionTree::This

This class.

Definition at line 58 of file DiscreteJunctionTree.h.

Constructor & Destructor Documentation

◆ DiscreteJunctionTree()

gtsam::DiscreteJunctionTree::DiscreteJunctionTree ( const DiscreteEliminationTree & eliminationTree )

Build the elimination tree of a factor graph using precomputed column structure.

Parameters

factorGraph	The factor graph for which to build the elimination tree
structure	The set of factors involving each variable. If this is not precomputed, you can call the Create(const FactorGraph<DERIVEDFACTOR>&) named constructor instead.

Returns: The elimination tree

Definition at line 30 of file DiscreteJunctionTree.cpp.

Member Function Documentation

◆ print()

void gtsam::DiscreteJunctionTree::print	(	const std::string &	name = `"DiscreteJunctionTree: "`,
		const KeyFormatter &	formatter = `DefaultKeyFormatter`
	)		const

Print the tree to cout

Definition at line 35 of file DiscreteJunctionTree.cpp.

The documentation for this class was generated from the following files:

Public Types

Constructors

Testable

Additional Inherited Members