49#ifndef DOXYGEN_SHOULD_SKIP_THIS
97 switch (change.type()) {
109 "edge modifications are not "
110 "supported by StructuralConstraintPossibleEdges");
129 switch (change.type()) {
140 "edge modifications are not supported "
141 "by StructuralConstraintPossibleEdges");
166# define GUM_CONSTRAINT_CLASS_NAME StructuralConstraintPossibleEdges
168# 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.
bool checkArcReversalAlone(NodeId x, NodeId y) const
checks whether the constraints enable to reverse arc (x,y)
bool isAlwaysInvalidAlone(const GraphChange &change) const
indicates whether a change will always violate the constraint
bool checkModificationAlone(const GraphChange &change) const
checks whether the constraints enable to perform a graph change
EdgeSet _PossibleEdges_possible_edges_
the PossibleEdges on which we perform checks
void addEdge(const Edge &edge)
assign a new forbidden arc
void setGraphAlone(const DiGraph &graph)
sets a new graph from which we will perform checkings
bool checkArcAdditionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to add arc (x,y)
void setEdges(const EdgeSet &set)
assign a set of forbidden arcs
const EdgeSet & edges() const
returns the set of mandatory arcs
void eraseEdge(const Edge &edge)
remove a forbidden arc
bool checkArcDeletionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to remove arc (x,y)
void modifyGraphAlone(const ArcAddition &change)
notify the constraint of a modification of the graph
#define GUM_ERROR(type, msg)
Set< Edge > EdgeSet
Some typdefs and define for shortcuts ...
Size NodeId
Type for node ids.
include the inlined functions if necessary
gum is the global namespace for all aGrUM entities