50 for (
NodeId i = 0; i < nb_nodes; ++i) {
virtual void addNodeWithId(const NodeId id)
try to insert a node with the given id
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
void setGraph(Size nb_nodes)
sets a new empty graph from which we will perform checkings
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.
StructuralConstraintDiGraph & operator=(const StructuralConstraintDiGraph &from)
copy operator
void setDAG(const DAG &dag)
sets the initial DAG from which changes shall be applied
StructuralConstraintDAG()
default constructor
std::size_t Size
In aGrUM, hashed values are unsigned long int.
StructuralConstraintDAG & operator=(const StructuralConstraintDAG &from)
copy operator
virtual ~StructuralConstraintDAG()
destructor
The base class for structural constraints used by learning algorithms that learn a directed graph str...
Size NodeId
Type for node ids.
DAGCycleDetector _DAG__cycle_detector
the cycle detector used to check quickly graph modifications
The base class for structural constraints imposed by DAGs.