51#ifndef DOXYGEN_SHOULD_SKIP_THIS
99 switch (change.type()) {
111 "edge modifications are not "
112 "supported by StructuralConstraintNoChildrenNodes");
131 switch (change.type()) {
143 "edge modifications are not supported "
144 "by StructuralConstraintNoChildrenNodes");
169# define GUM_CONSTRAINT_CLASS_NAME StructuralConstraintNoChildrenNodes
171# 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)
void addNode(NodeId node)
assign a new node without children
NodeSet _noChildrenNodes_
the set of w nodes without children on which we perform checks
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)
const NodeSet & nodes() const
returns the set of w nodes without children
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
void setNodes(const NodeSet &set)
assign a set of nodes without children
void modifyGraphAlone(const ArcAddition &change)
notify the constraint of a modification of the graph
void eraseNode(NodeId node)
remove a forbidden w node without children
bool checkArcDeletionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to remove arc (x,y)
#define GUM_ERROR(type, msg)
Size NodeId
Type for node ids.
Set< NodeId > NodeSet
Some typdefs and define for shortcuts ...
include the inlined functions if necessary
gum is the global namespace for all aGrUM entities
the structural constraint for forbidding children for some nodes during structure learning