48 for (
NodeId i = 0; i < nb_nodes; ++i) {
59 for (
const auto id : graph) {
the class for structural constraints limiting the number of parents of nodes in a directed graph ...
virtual ~StructuralConstraintIndegree()
destructor
gum is the global namespace for all aGrUM entities
the class for structural constraints limiting the number of parents of nodes in a directed graph ...
StructuralConstraintDiGraph & operator=(const StructuralConstraintDiGraph &from)
copy operator
Size _Indegree__max_indegree
a default max indegree to assign for nodes without specified indegree
StructuralConstraintIndegree()
default constructor
Base class for all oriented graphs.
the class for structural constraints limiting the number of parents of nodes in a directed graph ...
NodeProperty< Size > _Indegree__max_parents
the max number of parents per node
std::size_t Size
In aGrUM, hashed values are unsigned long int.
StructuralConstraintIndegree & operator=(const StructuralConstraintIndegree &from)
copy operator
The base class for structural constraints used by learning algorithms that learn a directed graph str...
Size NodeId
Type for node ids.