48#ifndef GUM_LEARNING_STRUCTURAL_CONSTRAINT_INDEGREE_H
49#define GUM_LEARNING_STRUCTURAL_CONSTRAINT_INDEGREE_H
252#ifndef DOXYGEN_SHOULD_SKIP_THIS
256# define GUM_CONSTRAINT_CLASS_NAME StructuralConstraintIndegree
258# undef GUM_CONSTRAINT_CLASS_NAME
Base class for all oriented graphs.
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.
The graph change substituting a triangle node1->node2->node3 + node1->node3 into v-structure node2->n...
The graph change substituting a triangle node1->node2->node3 + node1->node3 into v-structure node1->n...
void modifyGraphAlone(const ArcTriangleDeletion2 &change)
notify the constraint of a modification of the graph
bool checkModificationAlone(const ArcTriangleDeletion1 &change) const
checks whether the constraints enable to apply an ArcTriangleDeletion1
Size _Indegree_max_indegree_
a default max indegree to assign for nodes without specified indegree
bool checkArcTriangleDeletion1Alone(NodeId node1, NodeId node2, NodeId node3) const
checks whether the constraints enable to apply an ArcTriangleDeletion1
bool checkModificationAlone(const ArcAddition &change) const
checks whether the constraints enable to add an arc
void setMaxIndegree(Size max_indegree, bool update_all_node=false)
resets the default max indegree and possibly updates the indegree of all nodes
void modifyGraphAlone(const ArcAddition &change)
notify the constraint of a modification of the graph
StructuralConstraintIndegree & operator=(const StructuralConstraintIndegree &from)
copy operator
bool checkModificationAlone(const ArcDeletion &change) const
checks whether the constraints enable to remove an arc
void modifyGraphAlone(const ArcDeletion &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 checkModificationAlone(const ArcReversal &change) const
checks whether the constraints enable to reverse an arc
bool checkArcDeletionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to remove arc (x,y)
StructuralConstraintIndegree()
default constructor
void setIndegree(const NodeProperty< Size > &max_indegree)
sets the default max indegree for all the nodes in the property
void setGraphAlone(const DiGraph &graph)
sets a new graph from which we will perform checkings
Size maxIndegree() const
sets the default max indegree for all the nodes in the property
bool checkArcReversalAlone(NodeId x, NodeId y) const
checks whether the constraints enable to reverse arc (x,y)
NodeProperty< Size > _Indegree_max_parents_
the max number of parents per node
bool checkModificationAlone(const ArcTriangleDeletion2 &change) const
checks whether the constraints enable to apply an ArcTriangleDeletion2
bool checkArcAdditionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to add arc (x,y)
~StructuralConstraintIndegree() override
destructor
bool checkArcTriangleDeletion2Alone(NodeId node1, NodeId node2, NodeId node3) const
checks whether the constraints enable to apply an ArcTriangleDeletion2
void modifyGraphAlone(const ArcReversal &change)
notify the constraint of a modification of the graph
void modifyGraphAlone(const ArcTriangleDeletion1 &change)
notify the constraint of a modification of the graph
void modifyGraphAlone(const GraphChange &change)
notify the constraint of a modification of the graph
StructuralConstraintSetStatic()
std::size_t Size
In aGrUM, hashed values are unsigned long int.
Size NodeId
Type for node ids.
HashTable< NodeId, VAL > NodeProperty
Property on graph elements.
include the inlined functions if necessary
the base class for structural constraints used by learning algorithms that learn a directed graph str...
the class for structural constraints limiting the number of parents of nodes in a directed graph