48#ifndef GUM_LEARNING_STRUCTURAL_CONSTRAINT_DIGRAPH_H
49#define GUM_LEARNING_STRUCTURAL_CONSTRAINT_DIGRAPH_H
235#ifndef DOXYGEN_SHOULD_SKIP_THIS
239# define GUM_CONSTRAINT_CLASS_NAME StructuralConstraintDiGraph
241# 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 ArcDeletion &change)
notify the constraint of a modification of the graph
bool isAlwaysInvalidAlone(const GraphChange &change) const
indicates whether a change will always violate the constraint
bool checkModificationAlone(const ArcAddition &change) const
checks whether the constraints enable to add an arc
StructuralConstraintDiGraph & operator=(const StructuralConstraintDiGraph &from)
copy operator
bool checkModificationAlone(const ArcReversal &change) const
checks whether the constraints enable to reverse an arc
void modifyGraphAlone(const ArcTriangleDeletion2 &change)
notify the constraint of a modification of the graph
void modifyGraphAlone(const ArcTriangleDeletion1 &change)
notify the constraint of a modification of the graph
virtual ~StructuralConstraintDiGraph()
destructor
void modifyGraphAlone(const ArcAddition &change)
notify the constraint of a modification of the graph
StructuralConstraintDiGraph()
default constructor
void modifyGraphAlone(const ArcReversal &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)
bool checkArcReversalAlone(NodeId x, NodeId y) const
checks whether the constraints enable to reverse arc (x,y)
bool checkArcTriangleDeletion1Alone(NodeId node1, NodeId node2, NodeId node3) const
checks whether the constraints enable to apply an ArcTriangleDeletion1
bool checkModificationAlone(const ArcDeletion &change) const
checks whether the constraints enable to remove an arc
bool checkArcTriangleDeletion2Alone(NodeId node1, NodeId node2, NodeId node3) const
checks whether the constraints enable to apply an ArcTriangleDeletion2
void setGraph(Size nb_nodes)
sets a new empty graph from which we will perform checking
bool checkModificationAlone(const ArcTriangleDeletion1 &change) const
checks whether the constraints enable to apply an ArcTriangleDeletion1
DiGraph _graph_
the DiGraph on which we perform checks
void setGraphAlone(const DiGraph &graph)
sets a new graph from which we will perform checking
bool checkArcAdditionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to add arc (x,y)
bool checkModificationAlone(const ArcTriangleDeletion2 &change) const
checks whether the constraints enable to apply an ArcTriangleDeletion2
bool checkModificationAlone(const GraphChange &change) const
checks whether the constraints enable to perform a graph change
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 used by learning algorithms that learn a directed graph str...
the base class for all structural constraints