![]() |
aGrUM
0.20.3
a C++ library for (probabilistic) graphical models
|
#include <binaryJoinTreeConverter.h>
Public Member Functions | |
Constructors / Destructors | |
BinaryJoinTreeConverter () | |
default constructor More... | |
virtual | ~BinaryJoinTreeConverter () |
destructor More... | |
Accessors/Modifiers | |
virtual CliqueGraph | convert (const CliqueGraph &JT, const NodeProperty< Size > &domain_sizes, const NodeSet &roots)=0 |
returns a binary join tree corresponding to clique graph JT More... | |
virtual const NodeSet & | roots () const =0 |
returns all the roots considered for all the connected components More... | |
Definition at line 36 of file binaryJoinTreeConverter.h.
gum::BinaryJoinTreeConverter::BinaryJoinTreeConverter | ( | ) |
default constructor
Definition at line 34 of file binaryJoinTreeConverter.cpp.
References gum::Set< Key, Alloc >::emplace().
|
virtual |
destructor
Definition at line 40 of file binaryJoinTreeConverter.cpp.
References gum::Set< Key, Alloc >::emplace().
|
private |
forbid copy constructor
|
pure virtual |
returns a binary join tree corresponding to clique graph JT
This method creates and returns a new binary join tree compatible with that passed in argument (JT) and optimized for inference. As such, this requires knowing the join tree to be converted (of course), but also which roots will be used by the collect/diffusion inference engine and the domain size of the variables contained in the cliques of JT (to optimize the combination of the potentials contained in the cliques.
InvalidNode | exception is thrown if some roots do not belong to JT or if several roots belong to the same connected component. |
|
private |
forbid copy operator
|
pure virtual |
returns all the roots considered for all the connected components