92 for (
const NodeId cl: jt) {
95 for (
const auto node: jt.
clique(cl))
98 if (res < dSize) res = dSize;
const NodeSet & clique(const NodeId idClique) const
returns the set of nodes included into a given clique
virtual const CliqueGraph & junctionTree()=0
returns a compatible junction tree
const NodeProperty< Size > * domain_sizes_
the domain sizes of the variables/nodes of the graph
double maxLog10CliqueDomainSize()
returns the max of log10DomainSize of the cliques in the junction tree.
virtual ~Triangulation()
destructor
Triangulation()
default constructor
Size NodeId
Type for node ids.
HashTable< NodeId, VAL > NodeProperty
Property on graph elements.
gum is the global namespace for all aGrUM entities
CliqueGraph JunctionTree
a junction tree is a clique graph satisfying the running intersection property and such that no cliqu...
Abstract base class for computing triangulations of graphs.
Abstract base class for computing triangulations of graphs.