|
| | GaussianEliminationTree (const GaussianFactorGraph &factorGraph, const VariableIndex &structure, const Ordering &order) |
| | Build the elimination tree of a factor graph using pre-computed column structure. More...
|
| |
| | GaussianEliminationTree (const GaussianFactorGraph &factorGraph, const Ordering &order) |
| | Build the elimination tree of a factor graph. More...
|
| |
|
bool | equals (const This &other, double tol=1e-9) const |
| | Test whether the tree is equal to another.
|
| |
| std::pair< boost::shared_ptr< BayesNetType >, boost::shared_ptr< FactorGraphType > > | eliminate (Eliminate function) const |
| | Eliminate the factors to a Bayes net and remaining factor graph. More...
|
| |
|
const FastVector< sharedNode > & | roots () const |
| | Return the set of roots (one for a tree, multiple for a forest)
|
| |
|
const FastVector< sharedFactor > & | remainingFactors () const |
| | Return the remaining factors that are not pulled into elimination.
|
| |
|
void | swap (This &other) |
| | Swap the data of this tree with another one, this operation is very fast.
|
| |
|
void | print (const std::string &name="EliminationTree: ", const KeyFormatter &formatter=DefaultKeyFormatter) const |
| | Print the tree to cout.
|
| |
|
|
class | ::EliminationTreeTester |
| |
|
|
typedef EliminationTree< GaussianBayesNet, GaussianFactorGraph > | This |
| | This class.
|
| |
|
typedef boost::shared_ptr< This > | shared_ptr |
| | Shared pointer to this class.
|
| |
| | EliminationTree (const FactorGraphType &factorGraph, const VariableIndex &structure, const Ordering &order) |
| | Build the elimination tree of a factor graph using pre-computed column structure. More...
|
| |
| | EliminationTree (const FactorGraphType &factorGraph, const Ordering &order) |
| | Build the elimination tree of a factor graph. More...
|
| |
|
| EliminationTree (const This &other) |
| | Copy constructor - makes a deep copy of the tree structure, but only pointers to factors are copied, factors are not cloned.
|
| |
|
This & | operator= (const This &other) |
| | Assignment operator - makes a deep copy of the tree structure, but only pointers to factors are copied, factors are not cloned.
|
| |
|
| EliminationTree () |
| | Protected default constructor.
|
| |
|
bool | equals (const This &other, double tol=1e-9) const |
| | Test whether the tree is equal to another.
|
| |
|
FastVector< sharedNode > | roots_ |
| | concept check
|
| |
|
FastVector< sharedFactor > | remainingFactors_ |
| |
◆ GaussianEliminationTree() [1/2]
Build the elimination tree of a factor graph using pre-computed 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
◆ GaussianEliminationTree() [2/2]
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
-
| factorGraph | The factor graph for which to build the elimination tree |
The documentation for this class was generated from the following files: