aGrUM  0.16.0
unconstrainedTriangulation.cpp
Go to the documentation of this file.
1 
30 #include <agrum/agrum.h>
33 
34 namespace gum {
35 
36  // default constructor
39  const JunctionTreeStrategy& JTStrategy,
40  bool minimality) :
41  StaticTriangulation(elimSeq, JTStrategy, minimality) {
42  // for debugging purposes
43  GUM_CONSTRUCTOR(UnconstrainedTriangulation);
44  }
45 
46  // constructor with a given graph
48  const UndiGraph* theGraph,
49  const NodeProperty< Size >* domsizes,
51  const JunctionTreeStrategy& JTStrategy,
52  bool minimality) :
53  StaticTriangulation(theGraph, domsizes, elimSeq, JTStrategy, minimality) {
54  // for debugging purposes
55  GUM_CONSTRUCTOR(UnconstrainedTriangulation);
56  }
57 
60  const UnconstrainedTriangulation& from) :
61  StaticTriangulation(from) {
62  // for debugging purposes
63  GUM_CONS_CPY(UnconstrainedTriangulation);
64  }
65 
69  StaticTriangulation(std::move(from)) {
70  // for debugging purposes
71  GUM_CONS_MOV(UnconstrainedTriangulation);
72  }
73 
76  // for debugging purposes
77  GUM_DESTRUCTOR(UnconstrainedTriangulation);
78  }
79 
80 } /* namespace gum */
STL namespace.
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.
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
Definition: agrum.h:25
UnconstrainedTriangulation(const UnconstrainedEliminationSequenceStrategy &elimSeq, const JunctionTreeStrategy &JTStrategy, bool minimality=false)
default constructor
The class for generic Hash Tables.
Definition: hashTable.h:679
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
Base Class for all the algorithms producing a junction given a set of cliques/subcliques resulting fr...
base class for all non-incremental triangulation methods
Base class for undirected graphs.
Definition: undiGraph.h:109
The base class for all elimination sequence algorithms that require only the graph to be triangulated...