gtsam 4.2.0
gtsam
Loading...
Searching...
No Matches
DiscreteEliminationTree.h
Go to the documentation of this file.
1/* ----------------------------------------------------------------------------
2
3 * GTSAM Copyright 2010, Georgia Tech Research Corporation,
4 * Atlanta, Georgia 30332-0415
5 * All Rights Reserved
6 * Authors: Frank Dellaert, et al. (see THANKS for the full author list)
7
8 * See LICENSE for the license information
9
10 * -------------------------------------------------------------------------- */
11
19#pragma once
20
24
25namespace gtsam {
26
31 class GTSAM_EXPORT DiscreteEliminationTree :
32 public EliminationTree<DiscreteBayesNet, DiscreteFactorGraph>
33 {
34 public:
37 typedef boost::shared_ptr<This> shared_ptr;
38
48 const VariableIndex& structure, const Ordering& order);
49
56 const Ordering& order);
57
59 bool equals(const This& other, double tol = 1e-9) const;
60
61 private:
62
63 friend class ::EliminationTreeTester;
64
65 };
66
67}
Global functions in a separate testing namespace.
Definition chartTesting.h:28
Template to create a binary predicate.
Definition Testable.h:111
Elimination tree for discrete factors.
Definition DiscreteEliminationTree.h:33
DiscreteEliminationTree This
This class.
Definition DiscreteEliminationTree.h:36
boost::shared_ptr< This > shared_ptr
Shared pointer to this class.
Definition DiscreteEliminationTree.h:37
EliminationTree< DiscreteBayesNet, DiscreteFactorGraph > Base
Base class.
Definition DiscreteEliminationTree.h:35
A Discrete Factor Graph is a factor graph where all factors are Discrete, i.e.
Definition DiscreteFactorGraph.h:101
An elimination tree is a data structure used intermediately during elimination.
Definition EliminationTree.h:52
Definition Ordering.h:34
The VariableIndex class computes and stores the block column structure of a factor graph.
Definition VariableIndex.h:43