29 #ifndef GUM_LEARNING_STRUCTURAL_CONSTRAINT_INDEGREE_H 30 #define GUM_LEARNING_STRUCTURAL_CONSTRAINT_INDEGREE_H 51 StructuralConstraintDiGraph > {
199 #ifndef DOXYGEN_SHOULD_SKIP_THIS 203 # define GUM_CONSTRAINT_CLASS_NAME StructuralConstraintIndegree 205 # undef GUM_CONSTRAINT_CLASS_NAME 206 #endif // DOXYGEN_SHOULD_SKIP_THIS 221 #ifndef GUM_NO_INLINE void setIndegree(const NodeProperty< Size > &max_indegree)
sets the default max indegree for all the nodes in the property
the class for structural constraints limiting the number of parents of nodes in a directed graph ...
bool checkModificationAlone(const ArcAddition &change) const
checks whether the constraints enable to add an arc
virtual ~StructuralConstraintIndegree()
destructor
The class for notifying learning algorithms of new arc additionsThis class is convenient to know at c...
void setMaxIndegree(Size max_indegree, bool update_all_node=false)
resets the default max indegree and possibly updates the indegree of all nodes
The class for notifying learning algorithms of arc removalsThis class is convenient to know at compil...
bool isAlwaysInvalidAlone(const GraphChange &change) const
indicates whether a change will always violate the constraint
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
The class for generic Hash Tables.
Size _Indegree__max_indegree
a default max indegree to assign for nodes without specified indegree
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
the "meta-programming" class for storing structural constraintsIn aGrUM, there are two ways to store ...
bool checkArcDeletionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to remove arc (x,y)
bool checkArcAdditionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to add arc (x,y)
StructuralConstraintIndegree()
default constructor
Base class for all oriented graphs.
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
NodeProperty< Size > _Indegree__max_parents
the max number of parents per node
The class for notifying learning algorithms of arc reversalsThis class is convenient to know at compi...
void modifyGraphAlone(const ArcAddition &change)
notify the constraint of a modification of the graph
std::size_t Size
In aGrUM, hashed values are unsigned long int.
void setGraphAlone(const DiGraph &graph)
sets a new graph from which we will perform checkings
StructuralConstraintIndegree & operator=(const StructuralConstraintIndegree &from)
copy operator
Size NodeId
Type for node ids.
bool checkArcReversalAlone(NodeId x, NodeId y) const
checks whether the constraints enable to reverse arc (x,y)