Loading...
Searching...
No Matches
DiscreteEliminationTree.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/discrete/DiscreteBayesNet.h>
#include <gtsam/discrete/DiscreteFactorGraph.h>
#include <gtsam/inference/EliminationTree.h>
namespace gtsam {
class GTSAM_EXPORT DiscreteEliminationTree :
public EliminationTree<DiscreteBayesNet, DiscreteFactorGraph>
{
public:
typedef EliminationTree<DiscreteBayesNet, DiscreteFactorGraph> Base;
typedef DiscreteEliminationTree This;
typedef boost::shared_ptr<This> shared_ptr;
DiscreteEliminationTree(const DiscreteFactorGraph& factorGraph,
const VariableIndex& structure, const Ordering& order);
DiscreteEliminationTree(const DiscreteFactorGraph& factorGraph,
const Ordering& order);
bool equals(const This& other, double tol = 1e-9) const;
private:
friend class ::EliminationTreeTester;
};
}
DiscreteBayesNet.h
DiscreteFactorGraph.h
EliminationTree.h
gtsam
Global functions in a separate testing namespace.
Definition chartTesting.h:28
gtsam::DiscreteEliminationTree::This
DiscreteEliminationTree This
This class.
Definition DiscreteEliminationTree.h:36
gtsam::DiscreteEliminationTree::equals
bool equals(const This &other, double tol=1e-9) const
Test whether the tree is equal to another.
Definition DiscreteEliminationTree.cpp:39
gtsam::DiscreteEliminationTree::DiscreteEliminationTree
DiscreteEliminationTree(const DiscreteFactorGraph &factorGraph, const VariableIndex &structure, const Ordering &order)
Build the elimination tree of a factor graph using pre-computed column structure.
Definition DiscreteEliminationTree.cpp:28
gtsam::DiscreteEliminationTree::shared_ptr
boost::shared_ptr< This > shared_ptr
Shared pointer to this class.
Definition DiscreteEliminationTree.h:37
gtsam::DiscreteEliminationTree::Base
EliminationTree< DiscreteBayesNet, DiscreteFactorGraph > Base
Base class.
Definition DiscreteEliminationTree.h:35
gtsam::DiscreteFactorGraph
A Discrete Factor Graph is a factor graph where all factors are Discrete, i.e.
Definition DiscreteFactorGraph.h:101
gtsam::EliminationTree< DiscreteBayesNet, DiscreteFactorGraph >::EliminationTree
EliminationTree(const FactorGraphType &factorGraph, const VariableIndex &structure, const Ordering &order)
gtsam::Ordering
Definition Ordering.h:34
gtsam::VariableIndex
The VariableIndex class computes and stores the block column structure of a factor graph.
Definition VariableIndex.h:43