71 bool minimality) :
StaticTriangulation(theGraph, domsizes, elimSeq, JTStrategy, minimality) {
Base Class for all the algorithms producing a junction given a set of cliques/subcliques resulting fr...
StaticTriangulation(const EliminationSequenceStrategy &elimSeq, const JunctionTreeStrategy &JTStrategy, bool minimality=false)
default constructor: without any graph
The base class for all elimination sequence algorithms that require only the graph to be triangulated...
UnconstrainedTriangulation(const UnconstrainedEliminationSequenceStrategy &elimSeq, const JunctionTreeStrategy &JTStrategy, bool minimality=false)
default constructor
virtual ~UnconstrainedTriangulation()
destructor
Base class for undirected graphs.
HashTable< NodeId, VAL > NodeProperty
Property on graph elements.
gum is the global namespace for all aGrUM entities
Base Class for all elimination sequence algorithms that require only the graph to be triangulated and...
base class for graph triangulations without constraints on nodes elimination ordering.