50#ifndef DOXYGEN_SHOULD_SKIP_THIS
163# define GUM_CONSTRAINT_CLASS_NAME StructuralConstraintForbiddenArcs
165# undef GUM_CONSTRAINT_CLASS_NAME
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 setGraphAlone(const DiGraph &graph)
sets a new graph from which we will perform checkings
bool checkModificationAlone(const GraphChange &change) const
checks whether the constraints enable to perform a graph change
bool checkArcTriangleDeletion2Alone(NodeId node1, NodeId node2, NodeId node3) const
checks whether the constraints enable to apply an ArcTriangleDeletion2
ArcSet _forbidden_arcs_
the ForbiddenArcs on which we perform checks
void addArc(const Arc &arc)
assign a new forbidden arc
bool checkArcReversalAlone(NodeId x, NodeId y) const
checks whether the constraints enable to reverse arc (x,y)
const ArcSet & arcs() const
returns the set of mandatory arcs
bool checkArcTriangleDeletion1Alone(NodeId node1, NodeId node2, NodeId node3) const
checks whether the constraints enable to apply an ArcTriangleDeletion1
void modifyGraphAlone(const ArcAddition &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)
void eraseArc(const Arc &arc)
remove a forbidden arc
bool checkArcAdditionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to add arc (x,y)
void setArcs(const ArcSet &set)
assign a set of forbidden arcs
Size NodeId
Type for node ids.
Set< Arc > ArcSet
Some typdefs and define for shortcuts ...
include the inlined functions if necessary
the structural constraint for forbidding the creation of some arcs during structure learning