aGrUM  0.14.2
structuralConstraintDiGraph.cpp
Go to the documentation of this file.
1 /***************************************************************************
2  * Copyright (C) 2005 by Christophe GONZALES and Pierre-Henri WUILLEMIN *
3  * {prenom.nom}_at_lip6.fr *
4  * *
5  * This program is free software; you can redistribute it and/or modify *
6  * it under the terms of the GNU General Public License as published by *
7  * the Free Software Foundation; either version 2 of the License, or *
8  * (at your option) any later version. *
9  * *
10  * This program is distributed in the hope that it will be useful, *
11  * but WITHOUT ANY WARRANTY; without even the implied warranty of *
12  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
13  * GNU General Public License for more details. *
14  * *
15  * You should have received a copy of the GNU General Public License *
16  * along with this program; if not, write to the *
17  * Free Software Foundation, Inc., *
18  * 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *
19  ***************************************************************************/
28 
30 #ifdef GUM_NO_INLINE
32 #endif /* GUM_NO_INLINE */
33 
34 namespace gum {
35 
36  namespace learning {
37 
40  GUM_CONSTRUCTOR(StructuralConstraintDiGraph);
41  }
42 
45  setGraph(nb_nodes);
46  GUM_CONSTRUCTOR(StructuralConstraintDiGraph);
47  }
48 
51  const DiGraph& graph) {
52  setGraph(graph);
53  GUM_CONSTRUCTOR(StructuralConstraintDiGraph);
54  }
55 
58  const StructuralConstraintDiGraph& from) :
60  GUM_CONS_CPY(StructuralConstraintDiGraph);
61  }
62 
66  _DiGraph__graph(std::move(from._DiGraph__graph)) {
67  GUM_CONS_MOV(StructuralConstraintDiGraph);
68  }
69 
72  GUM_DESTRUCTOR(StructuralConstraintDiGraph);
73  }
74 
78  if (this != &from) { _DiGraph__graph = from._DiGraph__graph; }
79  return *this;
80  }
81 
85  if (this != &from) { _DiGraph__graph = std::move(from._DiGraph__graph); }
86  return *this;
87  }
88 
89  } /* namespace learning */
90 
91 } /* namespace gum */
void setGraph(Size nb_nodes)
sets a new empty graph from which we will perform checkings
STL namespace.
the base class for structural constraints used by learning algorithms that learn a directed graph str...
gum is the global namespace for all aGrUM entities
Definition: agrum.h:25
StructuralConstraintDiGraph & operator=(const StructuralConstraintDiGraph &from)
copy operator
DiGraph _DiGraph__graph
the DiGraph on which we perform checks
the base class for structural constraints used by learning algorithms that learn a directed graph str...
Base class for all oriented graphs.
Definition: diGraph.h:108
std::size_t Size
In aGrUM, hashed values are unsigned long int.
Definition: types.h:45
The base class for structural constraints used by learning algorithms that learn a directed graph str...