88 if (
this != &from) {
_DiGraph__graph = std::move(from._DiGraph__graph); }
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
DiGraph _DiGraph__graph
the DiGraph on which we perform checks
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
Base class for all oriented graphs.
virtual ~StructuralConstraintDiGraph()
destructor
StructuralConstraintDiGraph()
default constructor
std::size_t Size
In aGrUM, hashed values are unsigned long int.
The base class for structural constraints used by learning algorithms that learn a directed graph str...