30 #ifndef GUM_PARTIAL_ORDERED_TRIANGULATION_H 31 #define GUM_PARTIAL_ORDERED_TRIANGULATION_H 68 bool minimality =
false);
94 bool minimality =
false);
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.
gum is the global namespace for all aGrUM entities
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.
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'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.
virtual ~PartialOrderedTriangulation()
destructor
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...