49#ifndef DOXYGEN_SHOULD_SKIP_THIS
94 switch (change.type()) {
106 "edge modifications are not "
107 "supported by StructuralConstraintForbiddenArcs");
126 switch (change.type()) {
137 "edge modifications are not supported "
138 "by StructuralConstraintForbiddenArcs");
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.
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
ArcSet _ForbiddenArcs_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
void modifyGraphAlone(const ArcAddition &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 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
#define GUM_ERROR(type, msg)
Size NodeId
Type for node ids.
Set< Arc > ArcSet
Some typdefs and define for shortcuts ...
include the inlined functions if necessary
gum is the global namespace for all aGrUM entities