aGrUM  0.16.0
structuralConstraintUndiGraph.cpp
Go to the documentation of this file.
1 
31 
33 #ifdef GUM_NO_INLINE
35 #endif /* GUM_NO_INLINE */
36 
37 namespace gum {
38 
39  namespace learning {
40 
43  GUM_CONSTRUCTOR(StructuralConstraintUndiGraph);
44  }
45 
48  setGraph(nb_nodes);
49  GUM_CONSTRUCTOR(StructuralConstraintUndiGraph);
50  }
51 
54  const UndiGraph& graph) {
55  setGraph(graph);
56  GUM_CONSTRUCTOR(StructuralConstraintUndiGraph);
57  }
58 
61  const StructuralConstraintUndiGraph& from) :
63  GUM_CONS_CPY(StructuralConstraintUndiGraph);
64  }
65 
70  GUM_CONS_MOV(StructuralConstraintUndiGraph);
71  }
72 
75  GUM_DESTRUCTOR(StructuralConstraintUndiGraph);
76  }
77 
81  if (this != &from) { _UndiGraph__graph = from._UndiGraph__graph; }
82  return *this;
83  }
84 
88  if (this != &from) { _UndiGraph__graph = std::move(from._UndiGraph__graph); }
89  return *this;
90  }
91 
92  } /* namespace learning */
93 
94 } /* namespace gum */
UndiGraph _UndiGraph__graph
the UndiGraph on which we perform checks
STL namespace.
StructuralConstraintUndiGraph & operator=(const StructuralConstraintUndiGraph &from)
copy operator
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
Definition: agrum.h:25
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
The base class for structural constraints used by learning algorithms that learn an undirected graph ...
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
Base class for undirected graphs.
Definition: undiGraph.h:109
std::size_t Size
In aGrUM, hashed values are unsigned long int.
Definition: types.h:48