34 #ifndef GUM_LEARNING_STRUCTURAL_CONSTRAINT_TABU_LIST_H 35 #define GUM_LEARNING_STRUCTURAL_CONSTRAINT_TABU_LIST_H 44 #define GUM_STRUCTURAL_CONSTRAINT_TABU_LIST_DEFAULT_SIZE 2 195 #ifndef DOXYGEN_SHOULD_SKIP_THIS 199 # define GUM_CONSTRAINT_CLASS_NAME StructuralConstraintTabuList 201 # undef GUM_CONSTRAINT_CLASS_NAME 202 #endif // DOXYGEN_SHOULD_SKIP_THIS 217 #ifndef GUM_NO_INLINE
the classes to account for structure changes in a graph
The class for notifying learning algorithms of new arc additionsThis class is convenient to know at c...
void setTabuListSize(Size new_size)
sets the size of the tabu list
The class for notifying learning algorithms of arc removalsThis class is convenient to know at compil...
bool checkModificationAlone(const GraphChange &change) const
checks whether the constraints enable to perform a graph change
the base class for all structural constraints
gum is the global namespace for all aGrUM entities
virtual ~StructuralConstraintTabuList()
destructor
NodeId _TabuList__offset
the index of the oldest element
void setGraphAlone(const DiGraph &graph)
sets a new graph from which we will perform checkings
bool checkArcReversalAlone(NodeId x, NodeId y) const
checks whether the constraints enable to reverse arc (x,y)
StructuralConstraintTabuList & operator=(const StructuralConstraintTabuList &from)
copy operator
void modifyGraphAlone(const ArcAddition &change)
notify the constraint of a modification of the graph
the base class for all structural constraints
bool checkArcDeletionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to remove arc (x,y)
Base class for all oriented graphs.
Set of pairs of elements with fast search for both elements.
Bijection< GraphChange, NodeId > _TabuList__changes
the tabu list
bool isAlwaysInvalidAlone(const GraphChange &change) const
indicates whether a change will always violate the constraint
The class for notifying learning algorithms of arc reversalsThis class is convenient to know at compi...
The class imposing a N-sized tabu list as a structural constraints for learning algorithms.
the class imposing a N-sized tabu list as a structural constraints for learning algorithms ...
std::size_t Size
In aGrUM, hashed values are unsigned long int.
StructuralConstraintTabuList()
default constructor
bool checkArcAdditionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to add arc (x,y)
Size NodeId
Type for node ids.
Set of pairs of elements with fast search for both elements.