48#ifndef GUM_UNCONSTRAINED_TRIANGULATION_H
49#define GUM_UNCONSTRAINED_TRIANGULATION_H
105 bool minimality =
false);
122 bool minimality =
false);
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 * newFactory() const =0
returns a fresh triangulation (over an empty graph) of the same type as the current object
virtual ~UnconstrainedTriangulation()
destructor
virtual UnconstrainedTriangulation * copyFactory() const =0
virtual copy constructor
UnconstrainedTriangulation & operator=(const UnconstrainedTriangulation &)
forbid copy operator
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 non-incremental triangulations.
Base Class for all elimination sequence algorithms that require only the graph to be triangulated and...