68 for (
NodeId i = 0; i < nb_nodes; ++i) {
78 for (
const auto id: graph) {
Base class for all oriented graphs.
The base class for structural constraints used by learning algorithms that learn a directed graph str...
StructuralConstraintDiGraph & operator=(const StructuralConstraintDiGraph &from)
copy operator
the class for structural constraints limiting the number of parents of nodes in a directed graph
virtual ~StructuralConstraintIndegree()
destructor
Size _Indegree_max_indegree_
a default max indegree to assign for nodes without specified indegree
StructuralConstraintIndegree & operator=(const StructuralConstraintIndegree &from)
copy operator
StructuralConstraintIndegree()
default constructor
NodeProperty< Size > _Indegree_max_parents_
the max number of parents per node
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
the class for structural constraints limiting the number of parents of nodes in a directed graph
the class for structural constraints limiting the number of parents of nodes in a directed graph