aGrUM  0.16.0
unconstrainedEliminationSequenceStrategy.h
Go to the documentation of this file.
1 
45 #ifndef GUM_UNCONSTRAINED_ELIMINATION_SEQUENCE_STRATEGY_H
46 #define GUM_UNCONSTRAINED_ELIMINATION_SEQUENCE_STRATEGY_H
47 
49 
50 namespace gum {
51 
62  public:
63  // ############################################################################
65  // ############################################################################
67 
70 
76 
79 
81 
82 
83  protected:
84  // ############################################################################
86  // ############################################################################
88 
91 
93 
103  UndiGraph* graph, const NodeProperty< Size >* dom_sizes);
104 
108 
112 
114  };
115 
116 } /* namespace gum */
117 
118 #endif /* GUM_UNCONSTRAINED_ELIMINATION_SEQUENCE_STRATEGY_H */
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
Definition: agrum.h:25
The class for generic Hash Tables.
Definition: hashTable.h:679
UndiGraph * graph() const noexcept
returns the current graph
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
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:109
The base class for all elimination sequence algorithms that require only the graph to be triangulated...
virtual UnconstrainedEliminationSequenceStrategy * copyFactory() const =0
virtual copy constructor