21#include <boost/shared_ptr.hpp>
26class EliminationTreeTester;
50 template<
class BAYESNET,
class GRAPH>
64 typedef typename GRAPH::Eliminate Eliminate;
74 sharedFactor eliminate(
const boost::shared_ptr<BayesNetType>& output,
77 void print(
const std::string& str,
const KeyFormatter& keyFormatter)
const;
129 std::pair<boost::shared_ptr<BayesNetType>, boost::shared_ptr<FactorGraphType> >
137 void print(
const std::string& name =
"EliminationTree: ",
138 const KeyFormatter& formatter = DefaultKeyFormatter)
const;
142 bool equals(
const This& other,
double tol = 1e-9)
const;
165 friend class ::EliminationTreeTester;
Concept check for values that can be used in unit tests.
A thin wrapper around std::vector that uses a custom allocator.
std::vector< T, typename internal::FastDefaultVectorAllocator< T >::type > FastVector
FastVector is a type alias to a std::vector with a custom memory allocator.
Definition FastVector.h:34
Global functions in a separate testing namespace.
Definition chartTesting.h:28
std::uint64_t Key
Integer nonlinear key type.
Definition types.h:100
std::function< std::string(Key)> KeyFormatter
Typedef for a function to format a key, i.e. to convert it to a string.
Definition Key.h:35
Template to create a binary predicate.
Definition Testable.h:111
An elimination tree is a data structure used intermediately during elimination.
Definition EliminationTree.h:52
void print(const std::string &name="EliminationTree: ", const KeyFormatter &formatter=DefaultKeyFormatter) const
Print the tree to cout.
Definition EliminationTree-inst.h:207
std::pair< boost::shared_ptr< BayesNetType >, boost::shared_ptr< FactorGraphType > > eliminate(Eliminate function) const
Eliminate the factors to a Bayes net and remaining factor graph.
Definition EliminationTree-inst.h:187
This & operator=(const This &other)
Assignment operator - makes a deep copy of the tree structure, but only pointers to factors are copie...
Definition EliminationTree-inst.h:172
EliminationTree< BAYESNET, GRAPH > This
This class.
Definition EliminationTree.h:54
FastVector< sharedNode > roots_
concept check
Definition EliminationTree.h:86
boost::shared_ptr< FactorType > sharedFactor
Shared pointer to a factor.
Definition EliminationTree.h:60
BAYESNET BayesNetType
The BayesNet corresponding to FACTOR.
Definition EliminationTree.h:61
boost::shared_ptr< ConditionalType > sharedConditional
Shared pointer to a conditional.
Definition EliminationTree.h:63
const FastVector< sharedNode > & roots() const
Return the set of roots (one for a tree, multiple for a forest)
Definition EliminationTree.h:151
GRAPH FactorGraphType
The factor graph type.
Definition EliminationTree.h:58
void swap(This &other)
Swap the data of this tree with another one, this operation is very fast.
Definition EliminationTree-inst.h:283
EliminationTree()
Protected default constructor.
Definition EliminationTree.h:161
BayesNetType::ConditionalType ConditionalType
The type of conditionals.
Definition EliminationTree.h:62
boost::shared_ptr< This > shared_ptr
Shared pointer to this class.
Definition EliminationTree.h:55
GRAPH::FactorType FactorType
The type of factors.
Definition EliminationTree.h:59
boost::shared_ptr< Node > sharedNode
Shared pointer to Node.
Definition EliminationTree.h:80
const FastVector< sharedFactor > & remainingFactors() const
Return the remaining factors that are not pulled into elimination.
Definition EliminationTree.h:154
Definition EliminationTree.h:66
Key key
key associated with root
Definition EliminationTree.h:70
Children children
sub-trees
Definition EliminationTree.h:72
Factors factors
factors associated with root
Definition EliminationTree.h:71
The VariableIndex class computes and stores the block column structure of a factor graph.
Definition VariableIndex.h:43