aGrUM  0.14.2
partialOrderedTriangulation.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  ***************************************************************************/
30 #ifndef GUM_PARTIAL_ORDERED_TRIANGULATION_H
31 #define GUM_PARTIAL_ORDERED_TRIANGULATION_H
32 
36 
37 
38 namespace gum {
39 
40 
52  public:
53  // ############################################################################
55  // ############################################################################
57 
59 
68  bool minimality = false);
69 
71 
88  const UndiGraph* graph,
89  const NodeProperty< Size >* domsizes,
90  const List< NodeSet >* partial_order,
94  bool minimality = false);
95 
98 
101 
108  virtual PartialOrderedTriangulation* newFactory() const;
109 
111  virtual PartialOrderedTriangulation* copyFactory() const final;
112 
115 
117 
118 
119  // ############################################################################
121  // ############################################################################
123 
125 
132  virtual void setGraph(const UndiGraph* graph,
133  const NodeProperty< Size >* domsizes) final;
134 
137 
139  virtual void setPartialOrder(const List< NodeSet >* partial_order) final;
140 
142 
143 
144  protected:
146 
155  virtual void _initTriangulation(UndiGraph& graph) final;
156 
159 
161 
162  private:
165  };
166 
167 } /* namespace gum */
168 
169 #endif /* GUM_PARTIAL_ORDERED_TRIANGULATION_H */
const List< NodeSet > * __partial_order
the partial ordering to apply to eliminate nodes
virtual void _initTriangulation(UndiGraph &graph) final
the function called to initialize the triangulation process
Generic doubly linked lists.
Definition: list.h:369
gum is the global namespace for all aGrUM entities
Definition: agrum.h:25
virtual PartialOrderedTriangulation * newFactory() const
returns a fresh triangulation (over an empty graph) of the same type as the current object ...
An Elimination sequence algorithm that imposes a given partial ordering on the nodes elimination sequ...
PartialOrderedTriangulation & operator=(const PartialOrderedTriangulation &)
forbid copy operator
The class for generic Hash Tables.
Definition: hashTable.h:676
PartialOrderedTriangulation(const PartialOrderedEliminationSequenceStrategy &elimSeq=DefaultPartialOrderedEliminationSequenceStrategy(), const JunctionTreeStrategy &JTStrategy=DefaultJunctionTreeStrategy(), bool minimality=false)
default constructor
Base class for all elimination sequence algorithm that impose a given partial ordering on the nodes e...
class for graph triangulations for which we enforce a given partial ordering on the nodes elimination...
Base Class for all the algorithms producing a junction given a set of cliques/subcliques resulting fr...
virtual void setPartialOrder(const List< NodeSet > *partial_order) final
sets the elimination sequence&#39;s partial order (only a reference is stored)
base class for all non-incremental triangulations.
virtual PartialOrderedTriangulation * copyFactory() const final
virtual copy constructor
An algorithms producing a junction given the elimination tree produced by the triangulation algorithm...
base class for all non-incremental triangulation methods
Base class for undirected graphs.
Definition: undiGraph.h:106
virtual void setGraph(const UndiGraph *graph, const NodeProperty< Size > *domsizes) final
initialize the triangulation data structures for a new graph
An Elimination sequence algorithm that imposes a given partial ordering on the nodes elimination sequ...
An algorithm producing a junction given the elimination tree produced by a triangulation algorithm...