An Elimination sequence algorithm that imposes a given partial ordering on the nodes elimination sequence. More...

#include <defaultPartialOrderedEliminationSequenceStrategy.h>

Inheritance diagram for gum::DefaultPartialOrderedEliminationSequenceStrategy:

Collaboration diagram for gum::DefaultPartialOrderedEliminationSequenceStrategy:

Public Member Functions
Constructors / Destructors
	DefaultPartialOrderedEliminationSequenceStrategy (double theRatio=GUM_QUASI_RATIO, double theThreshold=GUM_WEIGHT_THRESHOLD)
	default constructor (uses an empty graph) More...

	DefaultPartialOrderedEliminationSequenceStrategy (UndiGraph graph, const NodeProperty< Size > dom_sizes, const List< NodeSet > *subsets, double ratio=GUM_QUASI_RATIO, double threshold=GUM_WEIGHT_THRESHOLD)
	constructor for an a priori non empty graph More...

	DefaultPartialOrderedEliminationSequenceStrategy (const DefaultPartialOrderedEliminationSequenceStrategy &from)
	copy constructor More...

	DefaultPartialOrderedEliminationSequenceStrategy (DefaultPartialOrderedEliminationSequenceStrategy &&from)
	move constructor More...

virtual	~DefaultPartialOrderedEliminationSequenceStrategy ()
	destructor More...

virtual DefaultPartialOrderedEliminationSequenceStrategy *	newFactory () const final
	creates a new elimination sequence of the same type as the current object, but this sequence contains only an empty graph More...

virtual DefaultPartialOrderedEliminationSequenceStrategy *	copyFactory () const final
	virtual copy constructor More...

Accessors / Modifiers
virtual bool	setGraph (UndiGraph graph, const NodeProperty< Size > dom_sizes) final
	sets a new graph to be triangulated More...

virtual void	clear () final
	clears the sequence (to prepare, for instance, a new elimination sequence) More...

virtual NodeId	nextNodeToEliminate () final
	returns the new node to be eliminated within the triangulation algorithm More...

virtual void	askFillIns (bool do_it) final
	if the elimination sequence is able to compute fill-ins, we indicate whether we want this feature to be activated More...

virtual bool	providesFillIns () const final
	indicates whether the fill-ins generated by the eliminated nodes, if needed, will be computed by the elimination sequence, or need be computed by the triangulation itself. More...

virtual bool	providesGraphUpdate () const final
	indicates whether the elimination sequence updates by itself the graph after a node has been eliminated More...

virtual void	eliminationUpdate (const NodeId node) final
	performs all the graph/fill-ins updates provided (if any) More...

virtual const EdgeSet &	fillIns () final
	in case fill-ins are provided, this function returns the fill-ins due to all the nodes eliminated so far More...

Accessors / Modifiers
virtual bool	setPartialOrder (const List< NodeSet > *subsets)
	sets a new partial ordering constraint on the elimination sequence More...

const List< NodeSet > *	partialOrder () const noexcept
	returns the current partial ordering More...

bool	isPartialOrderNeeded () const noexcept
	indicates if a new partial ordering is needed More...

Accessors / Modifiers
UndiGraph *	graph () const noexcept
	returns the current graph More...

const NodeProperty< Size > *	domainSizes () const noexcept
	returns the current domain sizes More...

Protected Attributes
const List< NodeSet > *	_subsets {nullptr}
	the subsets constituting the partial ordering More...

List< NodeSet >::const_iterator	_subset_iter
	the iterator indicating which is the current subset on which we work More...

NodeSet	_nodeset
	the nodes which can be currently eliminated More...

bool	_partial_order_needed {true}
	indicate whether a new partial ordering is necessary for the elimination More...

UndiGraph *	_graph {nullptr}
	the graph to be triangulated More...

const NodeProperty< Size > *	_domain_sizes {nullptr}
	the domain sizes of the variables/nodes More...

NodeProperty< double >	_log_domain_sizes
	the log of the domain sizes of the variables/nodes More...

Protected Member Functions
bool	_isPartialOrderNeeded (const List< NodeSet > *subsets) const
	indicate whether a partial ordering is compatible with the current graph More...

Detailed Description

An Elimination sequence algorithm that imposes a given partial ordering on the nodes elimination sequence.

Class DefaultPartialOrderedEliminationSequenceStrategy implements an elimination sequence algorithm that satisfies a partial ordering, that is, the set of all the nodes is divided into several subsets. All the nodes of the first subset must be eliminated before the nodes of the second, which must be eliminated before those of the third subset, and so on. Within a subset, the ordering is determined as follows:

the nodes that are simplicial (i.e., those that already form a clique

with their neighbors) are eliminated first

then the nodes that are almost simplicial (i.e. if we remove one of their

neighbors, they become simplicial) and that create small cliques, are eliminated (see Bodlaender's safe reductions)

the quasi simplicial nodes (i.e., the nodes that do not require many

fill-ins to create cliques) that would create small cliques, are eliminated

finally, the heuristic proposed by Kjaerulff(90) is used to compute the

last nodes to be eliminated.

Definition at line 79 of file defaultPartialOrderedEliminationSequenceStrategy.h.

Constructor & Destructor Documentation

◆ DefaultPartialOrderedEliminationSequenceStrategy() [1/4]

gum::DefaultPartialOrderedEliminationSequenceStrategy::DefaultPartialOrderedEliminationSequenceStrategy	(	double	theRatio = `GUM_QUASI_RATIO`,
		double	theThreshold = `GUM_WEIGHT_THRESHOLD`
	)

default constructor (uses an empty graph)

Parameters

theRatio	the ratio used by the SimplicialSet included in the DefaultEliminationSequenceStrategy
theThreshold	the weight threshhold of the SimplicialSet included in the DefaultEliminationSequenceStrategy

Definition at line 36 of file defaultPartialOrderedEliminationSequenceStrategy.cpp.

Referenced by copyFactory(), DefaultPartialOrderedEliminationSequenceStrategy(), and newFactory().

                                                                            :
       __simplicial_ratio(theRatio),
       __simplicial_threshold(theThreshold) {
     // for debugging purposes
     GUM_CONSTRUCTOR(DefaultPartialOrderedEliminationSequenceStrategy);
   }

Here is the caller graph for this function:

◆ DefaultPartialOrderedEliminationSequenceStrategy() [2/4]

gum::DefaultPartialOrderedEliminationSequenceStrategy::DefaultPartialOrderedEliminationSequenceStrategy	(	UndiGraph *	graph,
		const NodeProperty< Size > *	dom_sizes,
		const List< NodeSet > *	subsets,
		double	ratio = `GUM_QUASI_RATIO`,
		double	threshold = `GUM_WEIGHT_THRESHOLD`
	)

constructor for an a priori non empty graph

Parameters

graph	the graph to be triangulated, i.e., the nodes of which will be eliminated
dom_sizes	thedomain sizes of the nodes/variables
subsets	the list of the subsets constituting the partial ordering
ratio	the ratio used by the SimplicialSet included in the DefaultEliminationSequenceStrategy
threshold	the weight threshhold of the SimplicialSet included in the DefaultEliminationSequenceStrategy

Warning: Note that we allow dom_sizes to be defined over nodes/variables that do not belong to graph. These sizes will simply be ignored. However, it is compulsory that all the nodes of graph belong to dom_sizes; the graph is altered during the triangulation.; note that, by aGrUM's rule, the graph, the domain sizes and the sequence are not copied but only referenced by the elimination sequence algorithm.

Definition at line 46 of file defaultPartialOrderedEliminationSequenceStrategy.cpp.

References DefaultPartialOrderedEliminationSequenceStrategy(), setGraph(), and gum::PartialOrderedEliminationSequenceStrategy::setPartialOrder().

                                                :
       __simplicial_ratio(ratio),
       __simplicial_threshold(threshold) {
     setGraph(graph, dom_sizes);
     setPartialOrder(subsets);
 
     // for debugging purposes
     GUM_CONSTRUCTOR(DefaultPartialOrderedEliminationSequenceStrategy);
   }

Here is the call graph for this function:

◆ DefaultPartialOrderedEliminationSequenceStrategy() [3/4]

gum::DefaultPartialOrderedEliminationSequenceStrategy::DefaultPartialOrderedEliminationSequenceStrategy ( const DefaultPartialOrderedEliminationSequenceStrategy & from )

copy constructor

Warning: The newly created elimination sequence strategy points toward the same undirected graph as the one contained in from but each strategy possesses its own simplicial set. As a result, if both elimination strategies are used at the same time, they will probably result in a mess because their simplicial sets won't be synchronized correctly with the changing undirected graph. So, whenever using this copy constructor, be sure that either from or the newly created strategy is used for a triangulation but not both. This will necessarily be OK in DefaultTriangulations.

Definition at line 63 of file defaultPartialOrderedEliminationSequenceStrategy.cpp.

References DefaultPartialOrderedEliminationSequenceStrategy().

                                                                       :
       PartialOrderedEliminationSequenceStrategy(from),
       // no need to set __log_weights because the copy of the simplicial set
       // will set it properly
       __simplicial_set(new SimplicialSet(*from.__simplicial_set,
                                          _graph,
                                          &_log_domain_sizes,
                                          &__log_weights,
                                          false)),
       __simplicial_ratio(from.__simplicial_ratio),
       __simplicial_threshold(from.__simplicial_threshold),
       __provide_fill_ins(from.__provide_fill_ins) {
     // for debugging purposes
     GUM_CONS_CPY(DefaultPartialOrderedEliminationSequenceStrategy);
   }

Here is the call graph for this function:

◆ DefaultPartialOrderedEliminationSequenceStrategy() [4/4]

gum::DefaultPartialOrderedEliminationSequenceStrategy::DefaultPartialOrderedEliminationSequenceStrategy ( DefaultPartialOrderedEliminationSequenceStrategy && from )

move constructor

Definition at line 82 of file defaultPartialOrderedEliminationSequenceStrategy.cpp.

References __log_weights, __simplicial_set, gum::SimplicialSet::replaceLogWeights(), and ~DefaultPartialOrderedEliminationSequenceStrategy().

                                                                  :
       PartialOrderedEliminationSequenceStrategy(std::move(from)),
       __log_weights(std::move(from.__log_weights)),
       __simplicial_set(from.__simplicial_set),
       __simplicial_ratio(from.__simplicial_ratio),
       __simplicial_threshold(from.__simplicial_threshold),
       __provide_fill_ins(from.__provide_fill_ins) {
     __simplicial_set->replaceLogWeights(&from.__log_weights, &__log_weights);
     from.__simplicial_set = nullptr;
 
     // for debugging purposes
     GUM_CONS_MOV(DefaultPartialOrderedEliminationSequenceStrategy);
   }

Here is the call graph for this function:

◆ ~DefaultPartialOrderedEliminationSequenceStrategy()

gum::DefaultPartialOrderedEliminationSequenceStrategy::~DefaultPartialOrderedEliminationSequenceStrategy ( )

virtual

destructor

Definition at line 99 of file defaultPartialOrderedEliminationSequenceStrategy.cpp.

References __simplicial_set.

Referenced by DefaultPartialOrderedEliminationSequenceStrategy().

                                                          {
     // for debugging purposes
     GUM_DESTRUCTOR(DefaultPartialOrderedEliminationSequenceStrategy);
 
     if (__simplicial_set) delete __simplicial_set;
   }

Here is the caller graph for this function:

Member Function Documentation

◆ __createSimplicialSet()

void gum::DefaultPartialOrderedEliminationSequenceStrategy::__createSimplicialSet ( )

private

create a new simplicial set suited for the current graph

Definition at line 107 of file defaultPartialOrderedEliminationSequenceStrategy.cpp.

References __log_weights, __provide_fill_ins, __simplicial_ratio, __simplicial_set, __simplicial_threshold, gum::EliminationSequenceStrategy::_graph, gum::EliminationSequenceStrategy::_log_domain_sizes, and gum::SimplicialSet::setFillIns().

Referenced by setGraph().

                                                                                {
     // remove the old simplicial set, if any
     if (__simplicial_set != nullptr) {
       delete __simplicial_set;
       __simplicial_set = nullptr;
     }
 
     if (_graph != nullptr) {
       // create a simplicial set suited for the graph
       __simplicial_set = new SimplicialSet(_graph,
                                            &_log_domain_sizes,
                                            &__log_weights,
                                            __simplicial_ratio,
                                            __simplicial_threshold);
 
       __simplicial_set->setFillIns(__provide_fill_ins);
     }
   }

Here is the call graph for this function:

Here is the caller graph for this function:

◆ __nodeToEliminate()

NodeId gum::DefaultPartialOrderedEliminationSequenceStrategy::__nodeToEliminate ( const PriorityQueue< NodeId, double > & possibleNodes )

private

returns the best possible node to be eliminated

this function is used by method nextNodeToEliminate

Definition at line 149 of file defaultPartialOrderedEliminationSequenceStrategy.cpp.

References gum::PartialOrderedEliminationSequenceStrategy::_nodeset, GUM_ERROR, and gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc, Gen >::priority().

Referenced by nextNodeToEliminate().

                                                            {
     bool   found = false;
     double min_score = 0;
     NodeId best_node = 0;
 
     for (const auto node : _nodeset) {
       try {
         double score = possibleNodes.priority(node);
 
         if (!found || (score < min_score)) {
           found = true;
           min_score = score;
           best_node = node;
         }
       } catch (NotFound&) {}
     }
 
     if (!found) { GUM_ERROR(NotFound, "no possible node to eliminate"); }
 
     return best_node;
   }

Here is the call graph for this function:

Here is the caller graph for this function:

◆ _isPartialOrderNeeded()

bool gum::PartialOrderedEliminationSequenceStrategy::_isPartialOrderNeeded ( const List< NodeSet > * subsets ) const

protectedinherited

indicate whether a partial ordering is compatible with the current graph

The method checks whether all the nodes of the graph belong to the partial ordering.

Returns: true if some nodes in _graph do not belong to subsets or if _graph is not defnined (nullptr)

Definition at line 102 of file partialOrderedEliminationSequenceStrategy.cpp.

References gum::EliminationSequenceStrategy::_graph, gum::NodeGraphPart::existsNode(), gum::Set< Key, Alloc >::insert(), and gum::NodeGraphPart::size().

Referenced by gum::PartialOrderedEliminationSequenceStrategy::setPartialOrder().

                                            {
     if ((_graph == nullptr) || (subsets == nullptr)) return true;
 
     // determine the set of nodes in the subsets that belong to the graph
     NodeSet nodes_found(_graph->size() / 2);
     for (const auto& nodes : *subsets) {
       for (const auto node : nodes) {
         if (_graph->existsNode(node)) { nodes_found.insert(node); }
       }
     }
 
     // check that the size of nodes_found is equal to that of the graph
     return nodes_found.size() != _graph->size();
   }

Here is the call graph for this function:

Here is the caller graph for this function:

◆ askFillIns()

void gum::DefaultPartialOrderedEliminationSequenceStrategy::askFillIns ( bool do_it )

finalvirtual

if the elimination sequence is able to compute fill-ins, we indicate whether we want this feature to be activated

if the elimination sequence is able to compute fill-ins, we indicatewhether we want this feature to be activated

Parameters

do_it when true and the elimination sequence has the ability to compute fill-ins, the elimination sequence will actually compute them (for the triangulation to use them), else they will not be available.

Implements gum::EliminationSequenceStrategy.

Definition at line 218 of file defaultPartialOrderedEliminationSequenceStrategy.cpp.

References __provide_fill_ins, __simplicial_set, and gum::SimplicialSet::setFillIns().

                                                                               {
     __provide_fill_ins = do_it;
 
     if (__simplicial_set) __simplicial_set->setFillIns(__provide_fill_ins);
   }

Here is the call graph for this function:

◆ clear()

void gum::DefaultPartialOrderedEliminationSequenceStrategy::clear ( )

finalvirtual

clears the sequence (to prepare, for instance, a new elimination sequence)

Reimplemented from gum::PartialOrderedEliminationSequenceStrategy.

Definition at line 138 of file defaultPartialOrderedEliminationSequenceStrategy.cpp.

References __log_weights, __simplicial_set, and gum::PartialOrderedEliminationSequenceStrategy::clear().

                                                                {
     PartialOrderedEliminationSequenceStrategy::clear();
     __log_weights.clear();
 
     if (__simplicial_set != nullptr) {
       delete __simplicial_set;
       __simplicial_set = nullptr;
     }
   }

Here is the call graph for this function:

◆ copyFactory()

DefaultPartialOrderedEliminationSequenceStrategy * gum::DefaultPartialOrderedEliminationSequenceStrategy::copyFactory ( ) const

finalvirtual

virtual copy constructor

Warning: The newly created elimination sequence strategy points toward the same undirected graph as the one contained in the current strategy but each strategy possesses its own simplicial set. As a result, if both elimination strategies are used at the same time, they will probably result in a mess because their simplicial sets won't be synchronized correctly with the changing undirected graph. So, whenever using this virtual copy constructor, be sure that either the current or the newly created strategy is used for a triangulation but not both. This will necessarily be OK in DefaultTriangulations.

Implements gum::PartialOrderedEliminationSequenceStrategy.

Definition at line 282 of file defaultPartialOrderedEliminationSequenceStrategy.cpp.

References DefaultPartialOrderedEliminationSequenceStrategy().

                                                                          {
     return new DefaultPartialOrderedEliminationSequenceStrategy(*this);
   }

Here is the call graph for this function:

◆ domainSizes()

INLINE const NodeProperty< Size > * gum::EliminationSequenceStrategy::domainSizes ( ) const

noexceptinherited

returns the current domain sizes

Definition at line 41 of file eliminationSequenceStrategy_inl.h.

References gum::EliminationSequenceStrategy::_domain_sizes.

                                                                        {
     return _domain_sizes;
   }

◆ eliminationUpdate()

void gum::DefaultPartialOrderedEliminationSequenceStrategy::eliminationUpdate ( const NodeId node )

finalvirtual

performs all the graph/fill-ins updates provided (if any)

performs all the graph/fill-ins updates provided

Parameters

node	the node the elimination of which requires the graph update

Reimplemented from gum::EliminationSequenceStrategy.

Definition at line 239 of file defaultPartialOrderedEliminationSequenceStrategy.cpp.

References __simplicial_set, gum::EliminationSequenceStrategy::_graph, gum::PartialOrderedEliminationSequenceStrategy::_nodeset, gum::PartialOrderedEliminationSequenceStrategy::_partial_order_needed, gum::PartialOrderedEliminationSequenceStrategy::_subset_iter, gum::PartialOrderedEliminationSequenceStrategy::_subsets, gum::Set< Key, Alloc >::empty(), gum::Set< Key, Alloc >::erase(), gum::SimplicialSet::eraseClique(), gum::NodeGraphPart::existsNode(), gum::Set< Key, Alloc >::insert(), and gum::SimplicialSet::makeClique().

                       {
     // check whether we can do something
     if (__simplicial_set != nullptr) {
       __simplicial_set->makeClique(id);
       __simplicial_set->eraseClique(id);
 
       if (!_partial_order_needed) {
         // remove the node from _nodeset
         _nodeset.erase(id);
 
         if (_nodeset.empty()) {
           // go to the next non-empty subset
           for (++_subset_iter; _subset_iter != _subsets->cend(); ++_subset_iter) {
             for (const auto node : *_subset_iter) {
               if (_graph->existsNode(node)) { _nodeset.insert(node); }
             }
             if (!_nodeset.empty()) break;
           }
         }
       }
     }
   }

Here is the call graph for this function:

◆ fillIns()

const EdgeSet & gum::DefaultPartialOrderedEliminationSequenceStrategy::fillIns ( )

finalvirtual

in case fill-ins are provided, this function returns the fill-ins due to all the nodes eliminated so far

in case fill-ins are provided, this function returns the fill-ins generated after the last node elimination

Reimplemented from gum::EliminationSequenceStrategy.

Definition at line 265 of file defaultPartialOrderedEliminationSequenceStrategy.cpp.

References __provide_fill_ins, __simplicial_set, gum::EliminationSequenceStrategy::fillIns(), and gum::SimplicialSet::fillIns().

                                                                            {
     if (!__provide_fill_ins || (__simplicial_set == nullptr))
       return EliminationSequenceStrategy::fillIns();
     else
       return __simplicial_set->fillIns();
   }

Here is the call graph for this function:

◆ graph()

INLINE UndiGraph * gum::EliminationSequenceStrategy::graph ( ) const

noexceptinherited

returns the current graph

Definition at line 34 of file eliminationSequenceStrategy_inl.h.

References gum::EliminationSequenceStrategy::_graph.

Referenced by gum::EliminationSequenceStrategy::setGraph().

                                                                       {
     return _graph;
   }

Here is the caller graph for this function:

◆ isPartialOrderNeeded()

INLINE bool gum::PartialOrderedEliminationSequenceStrategy::isPartialOrderNeeded ( ) const

noexceptinherited

indicates if a new partial ordering is needed

if the current partial ordering does not contain all the nodes of the graph or if the graph itself is not defined (nullptr) a new partial ordering will be needed for the next triangulation

Definition at line 43 of file partialOrderedEliminationSequenceStrategy_inl.h.

References gum::PartialOrderedEliminationSequenceStrategy::_partial_order_needed.

               {
     return _partial_order_needed;
   }

◆ newFactory()

DefaultPartialOrderedEliminationSequenceStrategy * gum::DefaultPartialOrderedEliminationSequenceStrategy::newFactory ( ) const

finalvirtual

creates a new elimination sequence of the same type as the current object, but this sequence contains only an empty graph

Warning: you must deallocate by yourself the object returned

Returns: an empty clone of the current object with the same type

Implements gum::PartialOrderedEliminationSequenceStrategy.

Definition at line 275 of file defaultPartialOrderedEliminationSequenceStrategy.cpp.

References __simplicial_ratio, __simplicial_threshold, and DefaultPartialOrderedEliminationSequenceStrategy().

                                                                         {
     return new DefaultPartialOrderedEliminationSequenceStrategy(
        __simplicial_ratio, __simplicial_threshold);
   }

Here is the call graph for this function:

◆ nextNodeToEliminate()

NodeId gum::DefaultPartialOrderedEliminationSequenceStrategy::nextNodeToEliminate ( )

finalvirtual

returns the new node to be eliminated within the triangulation algorithm

Exceptions

NotFound exception is thrown if there is no more node to eliminate in the graph

Implements gum::EliminationSequenceStrategy.

Definition at line 173 of file defaultPartialOrderedEliminationSequenceStrategy.cpp.

References __log_weights, __nodeToEliminate(), __simplicial_set, gum::EliminationSequenceStrategy::_graph, gum::PartialOrderedEliminationSequenceStrategy::_nodeset, gum::PartialOrderedEliminationSequenceStrategy::_partial_order_needed, gum::SimplicialSet::allAlmostSimplicialNodes(), gum::SimplicialSet::allQuasiSimplicialNodes(), gum::SimplicialSet::allSimplicialNodes(), gum::Set< Key, Alloc >::cbegin(), gum::Set< Key, Alloc >::cend(), gum::Set< Key, Alloc >::empty(), and GUM_ERROR.

                                                                                {
     // if there is no simplicial set, send an exception
     if (_graph == nullptr) GUM_ERROR(NotFound, "the graph is empty");
 
     if (_partial_order_needed)
       GUM_ERROR(NotFound,
                 "the partial order does not cover all the nodes "
                 "of the graph");
 
     if (_nodeset.empty()) { GUM_ERROR(NotFound, "no node is admissible"); }
 
     // select a node to be eliminated: try simplicial nodes, then almost
     // simplicial nodes, then quasi-simplicial nodes
     // note that if _graph != nullptr, __simplicial_set has been allocated
     try {
       return __nodeToEliminate(__simplicial_set->allSimplicialNodes());
     } catch (NotFound&) {}
 
     try {
       return __nodeToEliminate(__simplicial_set->allAlmostSimplicialNodes());
     } catch (NotFound&) {}
 
     try {
       return __nodeToEliminate(__simplicial_set->allQuasiSimplicialNodes());
     } catch (NotFound&) {}
 
     // here: select the node through Kjaerulff's heuristic
     auto   iter = _nodeset.cbegin();
     double min_score = __log_weights[*iter];
     NodeId best_node = *iter;
 
     for (++iter; iter != _nodeset.cend(); ++iter) {
       double score = __log_weights[*iter];
 
       if (score < min_score) {
         min_score = score;
         best_node = *iter;
       }
     }
 
     return best_node;
   }

Here is the call graph for this function:

◆ partialOrder()

INLINE const List< NodeSet > * gum::PartialOrderedEliminationSequenceStrategy::partialOrder ( ) const

noexceptinherited

returns the current partial ordering

Definition at line 36 of file partialOrderedEliminationSequenceStrategy_inl.h.

References gum::PartialOrderedEliminationSequenceStrategy::_subsets.

                                                                                       {
     return _subsets;
   }

◆ providesFillIns()

bool gum::DefaultPartialOrderedEliminationSequenceStrategy::providesFillIns ( ) const

finalvirtual

indicates whether the fill-ins generated by the eliminated nodes, if needed, will be computed by the elimination sequence, or need be computed by the triangulation itself.

indicates whether the new fill-ins generated by a new eliminated node, if needed, will be computed by the elimination sequence, or need be computed by the triangulation itself.

An elimination sequence provides fill-ins to its triangulation if and only if it has the ability to compute them and it has been asked to do so (by method askFillIns)

Implements gum::EliminationSequenceStrategy.

Definition at line 227 of file defaultPartialOrderedEliminationSequenceStrategy.cpp.

References __provide_fill_ins.

                                                                                {
     return __provide_fill_ins;
   }

◆ providesGraphUpdate()

bool gum::DefaultPartialOrderedEliminationSequenceStrategy::providesGraphUpdate ( ) const

finalvirtual

indicates whether the elimination sequence updates by itself the graph after a node has been eliminated

Implements gum::EliminationSequenceStrategy.

Definition at line 233 of file defaultPartialOrderedEliminationSequenceStrategy.cpp.

            {
     return true;
   }

◆ setGraph()

bool gum::DefaultPartialOrderedEliminationSequenceStrategy::setGraph	(	UndiGraph *	graph,
		const NodeProperty< Size > *	dom_sizes
	)

finalvirtual

sets a new graph to be triangulated

The elimination sequence algorithms reinitializes its data to start a new triangulation with graph Graph and a new partial ordrering

Parameters

graph	the new graph to be triangulated
dom_sizes	the domain sizes of the nodes/variables

Warning: Note that we allow dom_sizes to be defined over nodes/variables that do not belong to graph. These sizes will simply be ignored. However, it is compulsory that all the nodes of graph belong to dom_sizes; the graph is altered during the triangulation.; note that, by aGrUM's rule, the graph and the domain sizes are not copied but only referenced by the elimination sequence algorithm.

Reimplemented from gum::PartialOrderedEliminationSequenceStrategy.

Definition at line 127 of file defaultPartialOrderedEliminationSequenceStrategy.cpp.

References __createSimplicialSet(), and gum::PartialOrderedEliminationSequenceStrategy::setGraph().

Referenced by DefaultPartialOrderedEliminationSequenceStrategy().

                                                                  {
     if (PartialOrderedEliminationSequenceStrategy::setGraph(graph, domain_sizes)) {
       __createSimplicialSet();
       return true;
     }
 
     return false;
   }

Here is the call graph for this function:

Here is the caller graph for this function:

◆ setPartialOrder()

bool gum::PartialOrderedEliminationSequenceStrategy::setPartialOrder ( const List< NodeSet > * subsets )

virtualinherited

sets a new partial ordering constraint on the elimination sequence

sets a new partial order

Parameters

subsets the list of the subsets constituting the partial ordering

Returns: true if the new partial order has been successfully assigned (i.e., if all the nodes of the graph belong to one of the subsets)

Warning: if the subsets contain some nodes that do not belong to the graph, then these nodes are simply ignored.; note that, by aGrUM's rule, the partial ordering is not copied but only referenced by the elimination sequence algorithm.

Definition at line 119 of file partialOrderedEliminationSequenceStrategy.cpp.

References gum::EliminationSequenceStrategy::_graph, gum::PartialOrderedEliminationSequenceStrategy::_isPartialOrderNeeded(), gum::PartialOrderedEliminationSequenceStrategy::_nodeset, gum::PartialOrderedEliminationSequenceStrategy::_partial_order_needed, gum::PartialOrderedEliminationSequenceStrategy::_subset_iter, gum::PartialOrderedEliminationSequenceStrategy::_subsets, gum::Set< Key, Alloc >::clear(), gum::Set< Key, Alloc >::empty(), gum::NodeGraphPart::existsNode(), and gum::Set< Key, Alloc >::insert().

Referenced by gum::PartialOrderedTriangulation::_initTriangulation(), DefaultPartialOrderedEliminationSequenceStrategy(), gum::PartialOrderedEliminationSequenceStrategy::PartialOrderedEliminationSequenceStrategy(), and gum::PartialOrderedEliminationSequenceStrategy::setGraph().

                                      {
     // check that the partial order contains all the nodes of the graph
     _partial_order_needed = _isPartialOrderNeeded(subsets);
 
     if (!_partial_order_needed) {
       _subsets = subsets;
 
       // initialize properly the set of nodes that can be currently eliminated:
       // find the first subset that contains some node(s) of the graph
       _nodeset.clear();
       for (_subset_iter = _subsets->cbegin(); _subset_iter != _subsets->cend();
            ++_subset_iter) {
         for (const auto node : *_subset_iter) {
           if (_graph->existsNode(node)) { _nodeset.insert(node); }
         }
         if (!_nodeset.empty()) return true;
       }
     }
 
     return false;
   }