47#ifndef GUM_LEARNING_STRUCTURAL_CONSTRAINT_DAG_H
48#define GUM_LEARNING_STRUCTURAL_CONSTRAINT_DAG_H
253#ifndef DOXYGEN_SHOULD_SKIP_THIS
257# define GUM_CONSTRAINT_CLASS_NAME StructuralConstraintDAG
259# undef GUM_CONSTRAINT_CLASS_NAME
Base classes for directed acyclic graphs.
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 _unlock_() const
the methode to release a critical region used to modify graph
bool checkModificationAlone(const ArcTriangleDeletion1 &change) const
checks whether the constraints enable to apply an ArcTriangleDeletion1
bool isAlwaysInvalidAlone(const GraphChange &change) const
indicates whether a change will always violate the constraint
virtual ~StructuralConstraintDAG()
destructor
StructuralConstraintDAG & operator=(const StructuralConstraintDAG &from)
copy operator
bool checkModificationAlone(const ArcDeletion &change) const
checks whether the constraints enable to remove an arc
void modifyGraphAlone(const ArcTriangleDeletion1 &change)
notify the constraint of a modification of the graph
void setGraph(const DAG &graph)
sets a new graph from which we will perform checking
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
bool checkArcAdditionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to add arc (x,y)
StructuralConstraintDAG()
default constructor
bool checkArcReversalAlone(NodeId x, NodeId y) const
checks whether the constraints enable to reverse arc (x,y)
bool checkModificationAlone(const ArcAddition &change) const
checks whether the constraints enable to add an arc
void setGraphAlone(const DiGraph &graph)
sets a new graph from which we will perform checking
void setGraphAlone(Size nb_nodes)
sets a new empty graph from which we will perform checking
bool checkArcTriangleDeletion1Alone(NodeId node1, NodeId node2, NodeId node3) const
checks whether the constraints enable to apply an ArcTriangleDeletion1
void modifyGraphAlone(const ArcTriangleDeletion2 &change)
notify the constraint of a modification of the graph
void setGraph(Size nb_nodes)
sets a new empty graph from which we will perform checking
void _lock_() const
the method to lock a critical region in order to modify graph
bool checkArcTriangleDeletion2Alone(NodeId node1, NodeId node2, NodeId node3) const
checks whether the constraints enable to apply an ArcTriangleDeletion2
bool checkModificationAlone(const ArcReversal &change) const
checks whether the constraints enable to reverse an arc
bool checkModificationAlone(const ArcTriangleDeletion2 &change) const
checks whether the constraints enable to apply an ArcTriangleDeletion2
std::atomic_flag _lock_flag_
void modifyGraphAlone(const ArcDeletion &change)
notify the constraint of a modification of the graph
bool checkArcDeletionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to remove arc (x,y)
std::size_t Size
In aGrUM, hashed values are unsigned long int.
Size NodeId
Type for node ids.
include the inlined functions if necessary
gum is the global namespace for all aGrUM entities
the base class for all structural constraints
the base class for structural constraints imposed by DAGs
the base class for all structural constraints