31 #ifndef DOXYGEN_SHOULD_SKIP_THIS 37 const NodeProperty< Size >* domsizes,
40 double theThreshold) :
41 UnconstrainedTriangulation(theGraph,
43 DefaultEliminationSequenceStrategy(),
44 DefaultJunctionTreeStrategy(),
46 __quasi_ratio(theRatio), __threshold(theThreshold) {
48 GUM_CONSTRUCTOR(DefaultTriangulation);
54 double theThreshold) :
55 UnconstrainedTriangulation(DefaultEliminationSequenceStrategy(),
56 DefaultJunctionTreeStrategy(),
58 __quasi_ratio(theRatio), __threshold(theThreshold) {
60 GUM_CONSTRUCTOR(DefaultTriangulation);
65 UnconstrainedTriangulation(from), __quasi_ratio(from.__quasi_ratio),
66 __threshold(from.__threshold) {
68 GUM_CONS_CPY(DefaultTriangulation);
73 UnconstrainedTriangulation(
std::move(from)),
74 __quasi_ratio(from.__quasi_ratio), __threshold(from.__threshold) {
76 GUM_CONS_MOV(DefaultTriangulation);
82 GUM_DESTRUCTOR(DefaultTriangulation);
87 return new DefaultTriangulation(
88 isMinimalityRequired(), __quasi_ratio, __threshold);
93 return new DefaultTriangulation(*
this);
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
gum is the global namespace for all aGrUM entities
~DefaultTriangulation()
destructor
virtual DefaultTriangulation * copyFactory() const
virtual copy constructor
An algorithms producing a junction given the elimination tree produced by the triangulation algorithm...
Class for computing default triangulations of graphs.
An efficient unconstrained elimination sequence algorithm.