29 #ifndef GUM_ORDERED_TRIANGULATION_H 30 #define GUM_ORDERED_TRIANGULATION_H 65 bool minimality =
false);
88 const std::vector< NodeId >* sequence,
92 bool minimality =
false);
135 virtual void setOrder(
const std::vector< NodeId >* order)
final;
155 const std::vector< NodeId >*
__order{
nullptr};
virtual ~OrderedTriangulation()
destructor
An Elimination sequence algorithm that imposes a given complete ordering on the nodes elimination seq...
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
OrderedTriangulation(const OrderedEliminationSequenceStrategy &elimSeq=OrderedEliminationSequenceStrategy(), const JunctionTreeStrategy &JTStrategy=DefaultJunctionTreeStrategy(), bool minimality=false)
default constructor
The class for generic Hash Tables.
virtual OrderedTriangulation * copyFactory() const final
virtual copy constructor
Base Class for all the algorithms producing a junction given a set of cliques/subcliques resulting fr...
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
const std::vector< NodeId > * __order
the elimination sequence to apply
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
virtual void setOrder(const std::vector< NodeId > *order) final
sets the sequence of elimination (only the reference is stored)
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
OrderedTriangulation & operator=(const OrderedTriangulation &)
forbid copy operator
virtual void _initTriangulation(UndiGraph &graph) final
the function called to initialize the triangulation process
virtual OrderedTriangulation * newFactory() const final
returns a fresh triangulation over the same graph and of the same type as the current object (using t...
class for graph triangulations for which we enforce a given complete ordering on the nodes eliminatio...
base class for all non-incremental triangulation methods
Base class for undirected graphs.
virtual void setGraph(const UndiGraph *graph, const NodeProperty< Size > *domsizes) final
initialize the triangulation data structures for a new graph
An algorithm producing a junction given the elimination tree produced by a triangulation algorithm...