aGrUM  0.16.0
unconstrainedTriangulation.h
Go to the documentation of this file.
1 
29 #ifndef GUM_UNCONSTRAINED_TRIANGULATION_H
30 #define GUM_UNCONSTRAINED_TRIANGULATION_H
31 
34 
35 namespace gum {
36 
37 
46  public:
47  // ############################################################################
49  // ############################################################################
51 
58  virtual UnconstrainedTriangulation* newFactory() const = 0;
59 
61 
64  virtual UnconstrainedTriangulation* copyFactory() const = 0;
65 
68 
70 
71 
72  protected:
73  // ############################################################################
75  // ############################################################################
77 
79 
86  const JunctionTreeStrategy& JTStrategy,
87  bool minimality = false);
88 
90 
101  const UndiGraph* graph,
102  const NodeProperty< Size >* dom,
104  const JunctionTreeStrategy& JTStrategy,
105  bool minimality = false);
106 
109 
112 
114 
115 
116  private:
119  };
120 
121 } /* namespace gum */
122 
123 #endif /* GUM_UNCONSTRAINED_TRIANGULATION_H */
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.
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...
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.
Definition: undiGraph.h:109
The base class for all elimination sequence algorithms that require only the graph to be triangulated...