aGrUM
3.2.0
a C++ library for (probabilistic) graphical models
Toggle main menu visibility
structuralConstraintUndiGraph.cpp
Go to the documentation of this file.
1
/****************************************************************************
2
* This file is part of the aGrUM/pyAgrum library. *
3
* *
4
* Copyright (c) 2005-2026 by *
5
* - Pierre-Henri WUILLEMIN(_at_LIP6) *
6
* - Christophe GONZALES(_at_AMU) *
7
* *
8
* The aGrUM/pyAgrum library is free software; you can redistribute it *
9
* and/or modify it under the terms of either : *
10
* *
11
* - the GNU Lesser General Public License as published by *
12
* the Free Software Foundation, either version 3 of the License, *
13
* or (at your option) any later version, *
14
* - the MIT license (MIT), *
15
* - or both in dual license, as here. *
16
* *
17
* (see https://agrum.gitlab.io/articles/dual-licenses-lgplv3mit.html) *
18
* *
19
* This aGrUM/pyAgrum library is distributed in the hope that it will be *
20
* useful, but WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, *
21
* INCLUDING BUT NOT LIMITED TO THE WARRANTIES MERCHANTABILITY or FITNESS *
22
* FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE *
23
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER *
24
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, *
25
* ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR *
26
* OTHER DEALINGS IN THE SOFTWARE. *
27
* *
28
* See LICENCES for more details. *
29
* *
30
* SPDX-FileCopyrightText: Copyright 2005-2026 *
31
* - Pierre-Henri WUILLEMIN(_at_LIP6) *
32
* - Christophe GONZALES(_at_AMU) *
33
* SPDX-License-Identifier: LGPL-3.0-or-later OR MIT *
34
* *
35
* Contact : info_at_agrum_dot_org *
36
* homepage : http://agrum.gitlab.io *
37
* gitlab : https://gitlab.com/agrumery/agrum *
38
* *
39
****************************************************************************/
40
41
48
49
#include <
agrum/BN/learning/constraints/structuralConstraintUndiGraph.h
>
50
52
#ifdef GUM_NO_INLINE
53
# include <
agrum/BN/learning/constraints/structuralConstraintUndiGraph_inl.h
>
54
#endif
/* GUM_NO_INLINE */
55
56
namespace
gum
{
57
58
namespace
learning
{
59
61
StructuralConstraintUndiGraph::StructuralConstraintUndiGraph
() {
62
GUM_CONSTRUCTOR(
StructuralConstraintUndiGraph
);
63
}
64
66
StructuralConstraintUndiGraph::StructuralConstraintUndiGraph
(
Size
nb_nodes) {
67
setGraph
(nb_nodes);
68
GUM_CONSTRUCTOR(
StructuralConstraintUndiGraph
);
69
}
70
72
StructuralConstraintUndiGraph::StructuralConstraintUndiGraph
(
const
UndiGraph
&
graph
) {
73
setGraph
(
graph
);
74
GUM_CONSTRUCTOR(
StructuralConstraintUndiGraph
);
75
}
76
78
StructuralConstraintUndiGraph::StructuralConstraintUndiGraph
(
79
const
StructuralConstraintUndiGraph
& from) :
_UndiGraph_graph_
(from.
_UndiGraph_graph_
) {
80
GUM_CONS_CPY(
StructuralConstraintUndiGraph
);
81
}
82
84
StructuralConstraintUndiGraph::StructuralConstraintUndiGraph
(
85
StructuralConstraintUndiGraph
&& from) :
86
_UndiGraph_graph_
(
std
::move(from.
_UndiGraph_graph_
)) {
87
GUM_CONS_MOV(
StructuralConstraintUndiGraph
);
88
}
89
91
StructuralConstraintUndiGraph::~StructuralConstraintUndiGraph
() {
92
GUM_DESTRUCTOR(
StructuralConstraintUndiGraph
);
93
}
94
96
StructuralConstraintUndiGraph
&
97
StructuralConstraintUndiGraph::operator=
(
const
StructuralConstraintUndiGraph
& from) {
98
if
(
this
!= &from) {
_UndiGraph_graph_
= from.
_UndiGraph_graph_
; }
99
return
*
this
;
100
}
101
103
StructuralConstraintUndiGraph
&
104
StructuralConstraintUndiGraph::operator=
(
StructuralConstraintUndiGraph
&& from) {
105
if
(
this
!= &from) {
_UndiGraph_graph_
= std::move(from._UndiGraph_graph_); }
106
return
*
this
;
107
}
108
109
}
/* namespace learning */
110
111
}
/* namespace gum */
gum::UndiGraph
Base class for undirected graphs.
Definition
undiGraph.h:130
gum::learning::StructuralConstraintUndiGraph
The base class for structural constraints used by learning algorithms that learn an undirected graph ...
Definition
structuralConstraintUndiGraph.h:69
gum::learning::StructuralConstraintUndiGraph::~StructuralConstraintUndiGraph
virtual ~StructuralConstraintUndiGraph()
destructor
Definition
structuralConstraintUndiGraph.cpp:91
gum::learning::StructuralConstraintUndiGraph::_UndiGraph_graph_
UndiGraph _UndiGraph_graph_
the UndiGraph on which we perform checks
Definition
structuralConstraintUndiGraph.h:192
gum::learning::StructuralConstraintUndiGraph::operator=
StructuralConstraintUndiGraph & operator=(const StructuralConstraintUndiGraph &from)
copy operator
Definition
structuralConstraintUndiGraph.cpp:97
gum::learning::StructuralConstraintUndiGraph::setGraph
void setGraph(Size nb_nodes)
sets a new empty graph from which we will perform checkings
gum::learning::StructuralConstraintUndiGraph::StructuralConstraintUndiGraph
StructuralConstraintUndiGraph()
default constructor
Definition
structuralConstraintUndiGraph.cpp:61
gum::Size
std::size_t Size
In aGrUM, hashed values are unsigned long int.
Definition
types.h:74
gum::graph
Definition
bayesBall.h:79
gum::learning
include the inlined functions if necessary
Definition
CSVParser.h:55
gum
gum is the global namespace for all aGrUM entities
Definition
agrum.h:46
std
STL namespace.
structuralConstraintUndiGraph.h
the base class for structural constraints used by learning algorithms that learn an undirected graph ...
structuralConstraintUndiGraph_inl.h
the base class for structural constraints used by learning algorithms that learn an undirected graph ...
aGrUM
3.2.0
© PHW&CG&others - 2022
DoXyGeN 1.18.0