49#ifndef GUM_ORDERED_ELIMINATION_SEQUENCE_STRATEGY_H
50#define GUM_ORDERED_ELIMINATION_SEQUENCE_STRATEGY_H
89 const std::vector< NodeId >*
order);
142 virtual bool setOrder(
const std::vector< NodeId >*
order)
final;
145 virtual void clear()
final;
183 const std::vector< NodeId >*
order()
const noexcept;
196 const std::vector< NodeId >*
_order_{
nullptr};
EliminationSequenceStrategy()
default constructor
UndiGraph * graph() const noexcept
returns the current graph
virtual ~OrderedEliminationSequenceStrategy()
destructor
virtual OrderedEliminationSequenceStrategy * copyFactory() const final
virtual copy constructor
virtual OrderedEliminationSequenceStrategy * newFactory() const final
creates a new elimination sequence of the same type as the current object, but this sequence contains...
virtual NodeId nextNodeToEliminate() final
returns the new node to be eliminated within the triangulation algorithm
bool isOrderNeeded() const noexcept
indicates whether a new complete ordering is needed
bool _isOrderNeeded_(const std::vector< NodeId > *order) const
indicates whether an order is compatible with the current graph
const std::vector< NodeId > * order() const noexcept
returns the current complete ordering
virtual const EdgeSet & fillIns() final
in case fill-ins are provided, this function returns the fill-ins due to all the nodes eliminated so ...
virtual bool providesFillIns() const final
indicates whether the fill-ins generated by the eliminated nodes, if needed, will be computed by the ...
const std::vector< NodeId > * _order_
the vector indicating in which order we should eliminate the nodes
bool _order_needed_
indicate whether a new complete ordering is necessary for the elimination
virtual bool setGraph(UndiGraph *graph, const NodeProperty< Size > *dom_sizes) final
sets a new graph to be triangulated
std::size_t _order_index_
the index in the order indicating the new node to eliminate
virtual void eliminationUpdate(const NodeId node) final
performs all the graph/fill-ins updates provided (if any)
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 ...
virtual void clear() final
clears the order (to prepare, for instance, a new elimination sequence)
virtual bool providesGraphUpdate() const final
indicates whether the elimination sequence updates by itself the graph after a node has been eliminat...
virtual bool setOrder(const std::vector< NodeId > *order) final
sets the sequence of elimination
OrderedEliminationSequenceStrategy()
default constructor (uses an empty graph)
Base class for undirected graphs.
Base Class for all elimination sequence algorithms used by triangulations.
Set< Edge > EdgeSet
Some typdefs and define for shortcuts ...
Size NodeId
Type for node ids.
HashTable< NodeId, VAL > NodeProperty
Property on graph elements.
gum is the global namespace for all aGrUM entities
An Elimination sequence algorithm that imposes a given complete ordering on the nodes elimination seq...