aGrUM  0.14.2
unconstrainedTriangulation.h
Go to the documentation of this file.
1 /***************************************************************************
2  * Copyright (C) 2005 by Christophe GONZALES and Pierre-Henri WUILLEMIN *
3  * {prenom.nom}_at_lip6.fr *
4  * *
5  * This program is free software; you can redistribute it and/or modify *
6  * it under the terms of the GNU General Public License as published by *
7  * the Free Software Foundation; either version 2 of the License, or *
8  * (at your option) any later version. *
9  * *
10  * This program is distributed in the hope that it will be useful, *
11  * but WITHOUT ANY WARRANTY; without even the implied warranty of *
12  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
13  * GNU General Public License for more details. *
14  * *
15  * You should have received a copy of the GNU General Public License *
16  * along with this program; if not, write to the *
17  * Free Software Foundation, Inc., *
18  * 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *
19  ***************************************************************************/
26 #ifndef GUM_UNCONSTRAINED_TRIANGULATION_H
27 #define GUM_UNCONSTRAINED_TRIANGULATION_H
28 
31 
32 namespace gum {
33 
34 
43  public:
44  // ############################################################################
46  // ############################################################################
48 
55  virtual UnconstrainedTriangulation* newFactory() const = 0;
56 
58 
61  virtual UnconstrainedTriangulation* copyFactory() const = 0;
62 
65 
67 
68 
69  protected:
70  // ############################################################################
72  // ############################################################################
74 
76 
83  const JunctionTreeStrategy& JTStrategy,
84  bool minimality = false);
85 
87 
98  const UndiGraph* graph,
99  const NodeProperty< Size >* dom,
101  const JunctionTreeStrategy& JTStrategy,
102  bool minimality = false);
103 
106 
109 
111 
112 
113  private:
116  };
117 
118 } /* namespace gum */
119 
120 #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.
gum is the global namespace for all aGrUM entities
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:676
Base Class for all elimination sequence algorithms that require only the graph to be triangulated and...
Base Class for all the algorithms producing a junction given a set of cliques/subcliques resulting fr...
base class for all non-incremental triangulations.
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:106
The base class for all elimination sequence algorithms that require only the graph to be triangulated...