49#ifndef DOXYGEN_SHOULD_SKIP_THIS
86 switch (change.type()) {
95 "arc modifications are not "
96 "supported by StructuralConstraintUndiGraph");
112 switch (change.type()) {
123 "arc modifications are not supported "
124 "by StructuralConstraintUndiGraph");
136 for (
NodeId i = 0; i < nb_nodes; ++i) {
142# define GUM_CONSTRAINT_CLASS_NAME StructuralConstraintUndiGraph
144# undef GUM_CONSTRAINT_CLASS_NAME
The class for notifying learning algorithms of new edge additions.
The class for notifying learning algorithms of edge removals.
bool checkEdgeDeletionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to remove edge (x,y)
UndiGraph _UndiGraph_graph_
the UndiGraph on which we perform checks
void setGraphAlone(const UndiGraph &graph)
sets a new graph from which we will perform checkings
void modifyGraphAlone(const EdgeAddition &change)
notify the constraint of a modification of the graph
bool checkEdgeAdditionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to add edge (x,y)
void setGraph(Size nb_nodes)
sets a new empty graph from which we will perform checkings
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
#define GUM_ERROR(type, msg)
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