47#ifndef GUM_DEFAULT_TRIANGULATION_H
48#define GUM_DEFAULT_TRIANGULATION_H
91 bool minimality =
false,
DefaultTriangulation & operator=(const DefaultTriangulation &)
forbid copy operator
double _quasi_ratio_
the ratio above which we consider nodes to be quasi simplicial
double _threshold_
threshold under which almost and quasi simplicial nodes can be chosen to be eliminated
virtual DefaultTriangulation * newFactory() const
virtual clone constructor
DefaultTriangulation(const UndiGraph *graph, const NodeProperty< Size > *dom_sizes, bool minimality=false, double theRatio=GUM_QUASI_RATIO, double theThreshold=GUM_WEIGHT_THRESHOLD)
basic constructor. initialize the triangulation
DefaultTriangulation(DefaultTriangulation &&from)
move constructor
DefaultTriangulation(bool minimality=false, double theRatio=GUM_QUASI_RATIO, double theThreshold=GUM_WEIGHT_THRESHOLD)
default constructor: initialize the triangulation for an empty graph
virtual DefaultTriangulation * copyFactory() const
virtual copy constructor
DefaultTriangulation(const DefaultTriangulation &from)
copy constructor
~DefaultTriangulation()
destructor
UnconstrainedTriangulation(const UnconstrainedEliminationSequenceStrategy &elimSeq, const JunctionTreeStrategy &JTStrategy, bool minimality=false)
default constructor
Base class for undirected graphs.
HashTable< NodeId, VAL > NodeProperty
Property on graph elements.
gum is the global namespace for all aGrUM entities
Class for fast retrieval of simplicial and quasi/almost simplicial nodes.
#define GUM_WEIGHT_THRESHOLD
base class for graph triangulations without constraints on nodes elimination ordering.