aGrUM  0.16.0
junctionTreeStrategy.h
Go to the documentation of this file.
1 
30 #ifndef GUM_JUNCTION_TREE_STRATEGY_H
31 #define GUM_JUNCTION_TREE_STRATEGY_H
32 
33 #include <agrum/agrum.h>
34 
37 
38 namespace gum {
39 
40  class StaticTriangulation;
41 
49  public:
50  // ############################################################################
52  // ############################################################################
54 
56  virtual ~JunctionTreeStrategy();
57 
59  virtual JunctionTreeStrategy* newFactory() const = 0;
60 
62 
65  virtual JunctionTreeStrategy*
66  copyFactory(StaticTriangulation* triangulation = nullptr) const = 0;
67 
69 
70 
71  // ############################################################################
73  // ############################################################################
75 
82  virtual bool requiresFillIns() const = 0;
83 
85 
93  virtual const CliqueGraph& junctionTree() = 0;
94 
96  virtual void setTriangulation(StaticTriangulation* triangulation) = 0;
97 
100  virtual void moveTriangulation(StaticTriangulation* triangulation);
101 
104  virtual const NodeProperty< NodeId >& createdCliques() = 0;
105 
108  virtual NodeId createdClique(const NodeId id) = 0;
109 
111  virtual void clear() = 0;
112 
114 
115 
116  protected:
119 
120 
121  // ############################################################################
123  // ############################################################################
125 
128 
131 
134 
136  };
137 
138 } /* namespace gum */
139 
140 #endif /* GUM_JUNCTION_TREE_STRATEGY_H */
virtual const NodeProperty< NodeId > & createdCliques()=0
returns, for each node, the clique of the junction tree which was created by its deletion ...
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
Definition: agrum.h:25
virtual bool requiresFillIns() const =0
indicates whether the junction tree strategy needs fill-ins to work properly
StaticTriangulation * _triangulation
the triangulation to which the junction tree is associated
The class for generic Hash Tables.
Definition: hashTable.h:679
virtual void clear()=0
resets the current junction tree strategy data structures
virtual JunctionTreeStrategy * copyFactory(StaticTriangulation *triangulation=nullptr) const =0
virtual copy constructor
virtual void setTriangulation(StaticTriangulation *triangulation)=0
assigns the triangulation to the junction tree strategy
Base Class for all the algorithms producing a junction given a set of cliques/subcliques resulting fr...
Basic graph of cliques.
Definition: cliqueGraph.h:58
JunctionTreeStrategy()
default constructor
base class for all non-incremental triangulation methods
virtual ~JunctionTreeStrategy()
destructor
virtual NodeId createdClique(const NodeId id)=0
returns the Id of the clique of the junction tree created by the elimination of a given node during t...
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
virtual const CliqueGraph & junctionTree()=0
returns the junction tree computed
virtual JunctionTreeStrategy * newFactory() const =0
create a clone not assigned to any triangulation algorithm
virtual void moveTriangulation(StaticTriangulation *triangulation)
assigns a new triangulation to the junction tree strategy during a move construction ...
Size NodeId
Type for node ids.
Definition: graphElements.h:98
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.