64#ifndef GUM_UNCONSTRAINED_ELIMINATION_SEQUENCE_STRATEGY_H
65#define GUM_UNCONSTRAINED_ELIMINATION_SEQUENCE_STRATEGY_H
EliminationSequenceStrategy()
default constructor
UndiGraph * graph() const noexcept
returns the current graph
virtual ~UnconstrainedEliminationSequenceStrategy()
destructor
virtual UnconstrainedEliminationSequenceStrategy * copyFactory() const =0
virtual copy constructor
UnconstrainedEliminationSequenceStrategy()
default constructor
virtual UnconstrainedEliminationSequenceStrategy * newFactory() const =0
creates a new elimination sequence of the same type as the current object, but this sequence contains...
Base class for undirected graphs.
Base Class for all elimination sequence algorithms used by triangulations.
HashTable< NodeId, VAL > NodeProperty
Property on graph elements.
gum is the global namespace for all aGrUM entities