29 #ifndef GUM_UNCONSTRAINED_TRIANGULATION_H 30 #define GUM_UNCONSTRAINED_TRIANGULATION_H 87 bool minimality =
false);
105 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.
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
UnconstrainedTriangulation(const UnconstrainedEliminationSequenceStrategy &elimSeq, const JunctionTreeStrategy &JTStrategy, bool minimality=false)
default constructor
The class for generic Hash Tables.
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
virtual ~UnconstrainedTriangulation()
destructor
Base Class for all the algorithms producing a junction given a set of cliques/subcliques resulting fr...
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
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...