56#ifndef GUM_LEARNING_STRUCTURAL_CONSTRAINT_TABU_LIST_H
57#define GUM_LEARNING_STRUCTURAL_CONSTRAINT_TABU_LIST_H
65#define GUM_STRUCTURAL_CONSTRAINT_TABU_LIST_DEFAULT_SIZE 2
248#ifndef DOXYGEN_SHOULD_SKIP_THIS
252# define GUM_CONSTRAINT_CLASS_NAME StructuralConstraintTabuList
254# undef GUM_CONSTRAINT_CLASS_NAME
Base class for all oriented graphs.
The class for notifying learning algorithms of new arc additions.
The class for notifying learning algorithms of arc removals.
The class for notifying learning algorithms of arc reversals.
The graph change substituting a triangle node1->node2->node3 + node1->node3 into v-structure node2->n...
The graph change substituting a triangle node1->node2->node3 + node1->node3 into v-structure node1->n...
void modifyGraphAlone(const ArcReversal &change)
notify the constraint of a modification of the graph
void modifyGraphAlone(const ArcAddition &change)
notify the constraint of a modification of the graph
void setTabuListSize(Size new_size)
sets the size of the tabu list
bool checkArcTriangleDeletion1Alone(NodeId node1, NodeId node2, NodeId node3) const
checks whether the constraints enable to apply an ArcTriangleDeletion1
bool checkArcDeletionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to remove arc (x,y)
Size _tabuList_offset_
the index of the oldest element
bool checkModificationAlone(const GraphChange &change) const
checks whether the constraints enable to perform a graph change
bool checkModificationAlone(const ArcDeletion &change) const
checks whether the constraints enable to remove an arc
bool checkModificationAlone(const ArcTriangleDeletion1 &change) const
checks whether the constraints enable to apply an ArcTriangleDeletion1
bool checkArcAdditionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to add arc (x,y)
bool isAlwaysInvalidAlone(const GraphChange &change) const
indicates whether a change will always violate the constraint
Bijection< GraphHash, Size > _graph_tabuList_
the tabu list
bool checkModificationAlone(const ArcReversal &change) const
checks whether the constraints enable to reverse an arc
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)
virtual ~StructuralConstraintTabuList()
destructor
void modifyGraphAlone(const ArcDeletion &change)
notify the constraint of a modification of the graph
Size _tabuList_size_
the max size of the tabu list
StructuralConstraintTabuList & operator=(const StructuralConstraintTabuList &from)
copy operator
bool checkModificationAlone(const ArcTriangleDeletion2 &change) const
checks whether the constraints enable to apply an ArcTriangleDeletion2
std::pair< Size, Size > GraphHash
The representation of a graph: a graph is defined by its set of arcs.
bool checkArcTriangleDeletion2Alone(NodeId node1, NodeId node2, NodeId node3) const
checks whether the constraints enable to apply an ArcTriangleDeletion2
GraphHash _xorHashes_(const GraphHash &hash1, const GraphHash &hash2) const
GraphHash _hashArc_(NodeId node1, NodeId node2) const
GraphHash _current_graph_
the current graph hash
bool checkModificationAlone(const ArcAddition &change) const
checks whether the constraints enable to add an arc
StructuralConstraintTabuList()
default constructor
void modifyGraphAlone(const ArcTriangleDeletion1 &change)
notify the constraint of a modification of the graph
GraphHash _xorWithCurrentGraph_(const GraphHash &hash) const
void modifyGraphAlone(const ArcTriangleDeletion2 &change)
notify the constraint of a modification of the graph
std::size_t Size
In aGrUM, hashed values are unsigned long int.
Size NodeId
Type for node ids.
gum is the global namespace for all aGrUM entities
the base class for all structural constraints
the class imposing a N-sized tabu list as a structural constraints for learning algorithms
the base class for all structural constraints