85 static_cast< const PartialOrderedEliminationSequenceStrategy& >(
EliminationSequenceStrategy * _elimination_sequence_strategy
the elimination sequence strategy used by the triangulation
const List< NodeSet > * __partial_order
the partial ordering to apply to eliminate nodes
virtual bool setPartialOrder(const List< NodeSet > *subsets)
sets a new partial ordering constraint on the elimination sequence
JunctionTreeStrategy * _junction_tree_strategy
the junction tree strategy used by the triangulation
virtual void _initTriangulation(UndiGraph &graph) final
the function called to initialize the triangulation process
Generic doubly linked lists.
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
virtual PartialOrderedTriangulation * newFactory() const
returns a fresh triangulation (over an empty graph) of the same type as the current object ...
The class for generic Hash Tables.
PartialOrderedTriangulation(const PartialOrderedEliminationSequenceStrategy &elimSeq=DefaultPartialOrderedEliminationSequenceStrategy(), const JunctionTreeStrategy &JTStrategy=DefaultJunctionTreeStrategy(), bool minimality=false)
default constructor
const NodeProperty< Size > * _domain_sizes
the domain sizes of the variables/nodes of the graph
Base class for all elimination sequence algorithm that impose a given partial ordering on the nodes e...
virtual bool setGraph(UndiGraph *graph, const NodeProperty< Size > *dom_sizes)
sets a new graph to be triangulated
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)
virtual PartialOrderedTriangulation * copyFactory() const final
virtual copy constructor
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
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)
initialize the triangulation data structures for a new graph
virtual void setGraph(const UndiGraph *graph, const NodeProperty< Size > *domsizes) final
initialize the triangulation data structures for a new graph