gtsam 4.2.0
gtsam
DiscreteJunctionTree.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
27 // Forward declarations
28 class DiscreteEliminationTree;
29
51 class GTSAM_EXPORT DiscreteJunctionTree :
52 public JunctionTree<DiscreteBayesTree, DiscreteFactorGraph> {
53 public:
56 typedef boost::shared_ptr<This> shared_ptr;
57
66 DiscreteJunctionTree(const DiscreteEliminationTree& eliminationTree);
67 };
68
69}
Discrete Bayes Tree, the result of eliminating a DiscreteJunctionTree.
The junction tree.
Global functions in a separate testing namespace.
Definition: chartTesting.h:28
Elimination tree for discrete factors.
Definition: DiscreteEliminationTree.h:33
An EliminatableClusterTree, i.e., a set of variable clusters with factors, arranged in a tree,...
Definition: DiscreteJunctionTree.h:52
JunctionTree< DiscreteBayesTree, DiscreteFactorGraph > Base
Base class.
Definition: DiscreteJunctionTree.h:54
boost::shared_ptr< This > shared_ptr
Shared pointer to this class.
Definition: DiscreteJunctionTree.h:56
DiscreteJunctionTree This
This class.
Definition: DiscreteJunctionTree.h:55
A JunctionTree is a cluster tree, a set of variable clusters with factors, arranged in a tree,...
Definition: JunctionTree.h:50