Loading...
Searching...
No Matches
JunctionTree.h
Go to the documentation of this file.
/* ----------------------------------------------------------------------------
* GTSAM Copyright 2010, Georgia Tech Research Corporation,
* Atlanta, Georgia 30332-0415
* All Rights Reserved
* Authors: Frank Dellaert, et al. (see THANKS for the full author list)
* See LICENSE for the license information
* -------------------------------------------------------------------------- */
#pragma once
#include <gtsam/inference/ClusterTree.h>
namespace gtsam {
// Forward declarations
template<class BAYESNET, class GRAPH> class EliminationTree;
template<class BAYESTREE, class GRAPH>
class JunctionTree : public EliminatableClusterTree<BAYESTREE, GRAPH> {
public:
typedef JunctionTree<BAYESTREE, GRAPH> This;
typedef boost::shared_ptr<This> shared_ptr;
typedef EliminatableClusterTree<BAYESTREE, GRAPH> Base;
protected:
template<class ETREE>
static This FromEliminationTree(const ETREE& eliminationTree) { return This(eliminationTree); }
template<class ETREE_BAYESNET, class ETREE_GRAPH>
JunctionTree(const EliminationTree<ETREE_BAYESNET, ETREE_GRAPH>& eliminationTree);
protected:
// Private default constructor (used in static construction methods)
JunctionTree() {}
};
}
ClusterTree.h
Collects factorgraph fragments defined on variable clusters, arranged in a tree.
gtsam
Global functions in a separate testing namespace.
Definition chartTesting.h:28
gtsam::EliminatableClusterTree::EliminatableClusterTree
EliminatableClusterTree(const This &other)
Copy constructor - makes a deep copy of the tree structure, but only pointers to factors are copied,...
Definition ClusterTree.h:207
gtsam::EliminationTree
An elimination tree is a data structure used intermediately during elimination.
Definition EliminationTree.h:52
gtsam::JunctionTree::FromEliminationTree
static This FromEliminationTree(const ETREE &eliminationTree)
Build the junction tree from an elimination tree.
Definition JunctionTree.h:65
gtsam::JunctionTree::JunctionTree
JunctionTree(const EliminationTree< ETREE_BAYESNET, ETREE_GRAPH > &eliminationTree)
Build the junction tree from an elimination tree.
Definition JunctionTree-inst.h:127
gtsam::JunctionTree< DiscreteBayesTree, DiscreteFactorGraph >::This
JunctionTree< DiscreteBayesTree, DiscreteFactorGraph > This
Definition JunctionTree.h:54
gtsam::JunctionTree< DiscreteBayesTree, DiscreteFactorGraph >::Base
EliminatableClusterTree< DiscreteBayesTree, DiscreteFactorGraph > Base
Definition JunctionTree.h:56
gtsam::JunctionTree< DiscreteBayesTree, DiscreteFactorGraph >::shared_ptr
boost::shared_ptr< This > shared_ptr
Definition JunctionTree.h:55