26 #ifndef GUM_UNCONSTRAINED_TRIANGULATION_H 27 #define GUM_UNCONSTRAINED_TRIANGULATION_H 84 bool minimality =
false);
102 bool minimality =
false);
UnconstrainedTriangulation & operator=(const UnconstrainedTriangulation &)
forbid copy operator
virtual UnconstrainedTriangulation * copyFactory() const =0
virtual copy constructor
Interface for all triangulation methods without constraints on node elimination orderings.
gum is the global namespace for all aGrUM entities
UnconstrainedTriangulation(const UnconstrainedEliminationSequenceStrategy &elimSeq, const JunctionTreeStrategy &JTStrategy, bool minimality=false)
default constructor
The class for generic Hash Tables.
Base Class for all elimination sequence algorithms that require only the graph to be triangulated and...
virtual ~UnconstrainedTriangulation()
destructor
Base Class for all the algorithms producing a junction given a set of cliques/subcliques resulting fr...
base class for all non-incremental triangulations.
virtual UnconstrainedTriangulation * newFactory() const =0
returns a fresh triangulation (over an empty graph) of the same type as the current object ...
base class for all non-incremental triangulation methods
Base class for undirected graphs.
The base class for all elimination sequence algorithms that require only the graph to be triangulated...