gtsam  4.1.0
gtsam
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 
25 namespace gtsam {
26 
27  class GTSAM_EXPORT DiscreteEliminationTree :
28  public EliminationTree<DiscreteBayesNet, DiscreteFactorGraph>
29  {
30  public:
33  typedef boost::shared_ptr<This> shared_ptr;
34 
44  const VariableIndex& structure, const Ordering& order);
45 
52  const Ordering& order);
53 
55  bool equals(const This& other, double tol = 1e-9) const;
56 
57  private:
58 
59  friend class ::EliminationTreeTester;
60 
61  };
62 
63 }
gtsam::equals
Template to create a binary predicate.
Definition: Testable.h:110
gtsam::Ordering
Definition: Ordering.h:34
gtsam::DiscreteEliminationTree::Base
EliminationTree< DiscreteBayesNet, DiscreteFactorGraph > Base
Base class.
Definition: DiscreteEliminationTree.h:31
EliminationTree.h
gtsam
Global functions in a separate testing namespace.
Definition: chartTesting.h:28
gtsam::DiscreteEliminationTree::shared_ptr
boost::shared_ptr< This > shared_ptr
Shared pointer to this class.
Definition: DiscreteEliminationTree.h:33
gtsam::EliminationTree
An elimination tree is a data structure used intermediately during elimination.
Definition: EliminationTree.h:52
gtsam::DiscreteFactorGraph
A Discrete Factor Graph is a factor graph where all factors are Discrete, i.e.
Definition: DiscreteFactorGraph.h:66
DiscreteBayesNet.h
gtsam::DiscreteEliminationTree
Definition: DiscreteEliminationTree.h:29
DiscreteFactorGraph.h
gtsam::DiscreteEliminationTree::This
DiscreteEliminationTree This
This class.
Definition: DiscreteEliminationTree.h:32
gtsam::VariableIndex
The VariableIndex class computes and stores the block column structure of a factor graph.
Definition: VariableIndex.h:43