Public Types | Public Member Functions | Friends | List of all members
gtsam::DiscreteEliminationTree Class Reference

#include <DiscreteEliminationTree.h>

Inheritance diagram for gtsam::DiscreteEliminationTree:
Inheritance graph
[legend]

Public Types

typedef EliminationTree< DiscreteBayesNet, DiscreteFactorGraphBase
 Base class. More...
 
typedef boost::shared_ptr< Thisshared_ptr
 Shared pointer to this class. More...
 
typedef DiscreteEliminationTree This
 This class. More...
 
- Public Types inherited from gtsam::EliminationTree< DiscreteBayesNet, DiscreteFactorGraph >
typedef DiscreteBayesNet BayesNetType
 The BayesNet corresponding to FACTOR. More...
 
typedef BayesNetType::ConditionalType ConditionalType
 The type of conditionals. More...
 
typedef DiscreteFactorGraph::Eliminate Eliminate
 
typedef DiscreteFactorGraph FactorGraphType
 The factor graph type. More...
 
typedef DiscreteFactorGraph::FactorType FactorType
 The type of factors. More...
 
typedef boost::shared_ptr< ConditionalTypesharedConditional
 Shared pointer to a conditional. More...
 
typedef boost::shared_ptr< FactorTypesharedFactor
 Shared pointer to a factor. More...
 
typedef boost::shared_ptr< Node > sharedNode
 Shared pointer to Node. More...
 

Public Member Functions

 DiscreteEliminationTree (const DiscreteFactorGraph &factorGraph, const VariableIndex &structure, const Ordering &order)
 
 DiscreteEliminationTree (const DiscreteFactorGraph &factorGraph, const Ordering &order)
 
bool equals (const This &other, double tol=1e-9) const
 
- Public Member Functions inherited from gtsam::EliminationTree< DiscreteBayesNet, DiscreteFactorGraph >
std::pair< boost::shared_ptr< BayesNetType >, boost::shared_ptr< FactorGraphType > > eliminate (Eliminate function) const
 
const FastVector< sharedNode > & roots () const
 
const FastVector< sharedFactor > & remainingFactors () const
 
void swap (This &other)
 
void print (const std::string &name="EliminationTree: ", const KeyFormatter &formatter=DefaultKeyFormatter) const
 

Friends

class ::EliminationTreeTester
 

Additional Inherited Members

- Protected Types inherited from gtsam::EliminationTree< DiscreteBayesNet, DiscreteFactorGraph >
typedef boost::shared_ptr< Thisshared_ptr
 Shared pointer to this class. More...
 
typedef EliminationTree< DiscreteBayesNet, DiscreteFactorGraphThis
 This class. More...
 
- Protected Member Functions inherited from gtsam::EliminationTree< DiscreteBayesNet, DiscreteFactorGraph >
 GTSAM_CONCEPT_TESTABLE_TYPE (FactorType)
 
 EliminationTree (const FactorGraphType &factorGraph, const VariableIndex &structure, const Ordering &order)
 
 EliminationTree (const FactorGraphType &factorGraph, const Ordering &order)
 
 EliminationTree (const This &other)
 
Thisoperator= (const This &other)
 
 EliminationTree ()
 Protected default constructor. More...
 
bool equals (const This &other, double tol=1e-9) const
 
- Protected Attributes inherited from gtsam::EliminationTree< DiscreteBayesNet, DiscreteFactorGraph >
FastVector< sharedFactorremainingFactors_
 
FastVector< sharedNoderoots_
 

Detailed Description

Definition at line 27 of file DiscreteEliminationTree.h.

Member Typedef Documentation

Base class.

Definition at line 31 of file DiscreteEliminationTree.h.

Shared pointer to this class.

Definition at line 33 of file DiscreteEliminationTree.h.

This class.

Definition at line 32 of file DiscreteEliminationTree.h.

Constructor & Destructor Documentation

gtsam::DiscreteEliminationTree::DiscreteEliminationTree ( const DiscreteFactorGraph factorGraph,
const VariableIndex structure,
const Ordering order 
)

Build the elimination tree of a factor graph using pre-computed column structure.

Parameters
factorGraphThe factor graph for which to build the elimination tree
structureThe 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 28 of file DiscreteEliminationTree.cpp.

gtsam::DiscreteEliminationTree::DiscreteEliminationTree ( const DiscreteFactorGraph factorGraph,
const Ordering order 
)

Build the elimination tree of a factor graph. Note that this has to compute the column structure as a VariableIndex, so if you already have this precomputed, use the other constructor instead.

Parameters
factorGraphThe factor graph for which to build the elimination tree

Definition at line 34 of file DiscreteEliminationTree.cpp.

Member Function Documentation

bool gtsam::DiscreteEliminationTree::equals ( const This other,
double  tol = 1e-9 
) const

Test whether the tree is equal to another

Definition at line 39 of file DiscreteEliminationTree.cpp.

Friends And Related Function Documentation

friend class ::EliminationTreeTester
friend

Definition at line 59 of file DiscreteEliminationTree.h.


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


gtsam
Author(s):
autogenerated on Sat May 8 2021 02:58:08