67 const std::vector< NodeId >* order,
Base Class for all the algorithms producing a junction given a set of cliques/subcliques resulting fr...
An Elimination sequence algorithm that imposes a given complete ordering on the nodes elimination seq...
virtual bool setGraph(UndiGraph *graph, const NodeProperty< Size > *dom_sizes) final
sets a new graph to be triangulated
virtual bool setOrder(const std::vector< NodeId > *order) final
sets the sequence of elimination
virtual void setOrder(const std::vector< NodeId > *order) final
sets the sequence of elimination (only the reference is stored)
const std::vector< NodeId > * _order_
the elimination sequence to apply
virtual ~OrderedTriangulation()
destructor
virtual void initTriangulation_(UndiGraph &graph) final
the function called to initialize the triangulation process
OrderedTriangulation(const OrderedEliminationSequenceStrategy &elimSeq=OrderedEliminationSequenceStrategy(), const JunctionTreeStrategy &JTStrategy=DefaultJunctionTreeStrategy(), bool minimality=false)
default constructor
virtual OrderedTriangulation * newFactory() const final
returns a fresh triangulation over the same graph and of the same type as the current object (using t...
virtual void setGraph(const UndiGraph *graph, const NodeProperty< Size > *domsizes) final
initialize the triangulation data structures for a new graph
virtual OrderedTriangulation * copyFactory() const final
virtual copy constructor
JunctionTreeStrategy * junction_tree_strategy_
the junction tree strategy used by the triangulation
StaticTriangulation(const EliminationSequenceStrategy &elimSeq, const JunctionTreeStrategy &JTStrategy, bool minimality=false)
default constructor: without any graph
EliminationSequenceStrategy * elimination_sequence_strategy_
the elimination sequence strategy used by the triangulation
virtual void setGraph(const UndiGraph *graph, const NodeProperty< Size > *domsizes)
initialize the triangulation data structures for a new graph
const NodeProperty< Size > * domain_sizes_
the domain sizes of the variables/nodes of the graph
Base class for undirected graphs.
HashTable< NodeId, VAL > NodeProperty
Property on graph elements.
gum is the global namespace for all aGrUM entities
class for graph triangulations for which we enforce a given complete ordering on the nodes eliminatio...