|
|
class | ::EliminationTreeTester |
| |
|
| void | print (const std::string &name="EliminationTree: ", const KeyFormatter &formatter=DefaultKeyFormatter) const |
| |
| bool | equals (const This &other, double tol=1e-9) const |
| |
◆ SymbolicEliminationTree() [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
◆ SymbolicEliminationTree() [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 |
◆ eliminate()
Eliminate the factors to a Bayes net and remaining factor graph
- Parameters
-
- Returns
- The Bayes net and factor graph resulting from elimination
◆ equals() [1/2]
| bool gtsam::SymbolicEliminationTree::equals |
( |
const This & |
other, |
|
|
double |
tol = 1e-9 |
|
) |
| const |
Test whether the tree is equal to another
◆ equals() [2/2]
Test whether the tree is equal to another
◆ print()
◆ remainingFactors()
Return the remaining factors that are not pulled into elimination
◆ roots()
Return the set of roots (one for a tree, multiple for a forest)
◆ swap()
Swap the data of this tree with another one, this operation is very fast.
◆ roots_
The documentation for this class was generated from the following file:
- /home/docs/checkouts/readthedocs.org/user_builds/gtsam-jlblanco-docs/checkouts/latest/gtsam/symbolic/SymbolicEliminationTree.h