aGrUM  0.14.2
unconstrainedEliminationSequenceStrategy.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  ***************************************************************************/
42 #ifndef GUM_UNCONSTRAINED_ELIMINATION_SEQUENCE_STRATEGY_H
43 #define GUM_UNCONSTRAINED_ELIMINATION_SEQUENCE_STRATEGY_H
44 
46 
47 namespace gum {
48 
59  public:
60  // ############################################################################
62  // ############################################################################
64 
67 
73 
76 
78 
79 
80  protected:
81  // ############################################################################
83  // ############################################################################
85 
88 
90 
100  UndiGraph* graph, const NodeProperty< Size >* dom_sizes);
101 
105 
109 
111  };
112 
113 } /* namespace gum */
114 
115 #endif /* GUM_UNCONSTRAINED_ELIMINATION_SEQUENCE_STRATEGY_H */
gum is the global namespace for all aGrUM entities
Definition: agrum.h:25
The class for generic Hash Tables.
Definition: hashTable.h:676
UndiGraph * graph() const noexcept
returns the current graph
Base Class for all elimination sequence algorithms used by triangulations.
virtual UnconstrainedEliminationSequenceStrategy * newFactory() const =0
creates a new elimination sequence of the same type as the current object, but this sequence contains...
The base class for all elimination sequence algorithms used by triangulation algorithms.
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...
virtual UnconstrainedEliminationSequenceStrategy * copyFactory() const =0
virtual copy constructor