aGrUM
0.20.3
a C++ library for (probabilistic) graphical models
structuralConstraintUndiGraph.cpp
Go to the documentation of this file.
1
/**
2
*
3
* Copyright (c) 2005-2021 by Pierre-Henri WUILLEMIN(@LIP6) & Christophe GONZALES(@AMU)
4
* info_at_agrum_dot_org
5
*
6
* This library is free software: you can redistribute it and/or modify
7
* it under the terms of the GNU Lesser General Public License as published by
8
* the Free Software Foundation, either version 3 of the License, or
9
* (at your option) any later version.
10
*
11
* This library is distributed in the hope that it will be useful,
12
* but WITHOUT ANY WARRANTY; without even the implied warranty of
13
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14
* GNU Lesser General Public License for more details.
15
*
16
* You should have received a copy of the GNU Lesser General Public License
17
* along with this library. If not, see <http://www.gnu.org/licenses/>.
18
*
19
*/
20
21
22
/** @file
23
* @brief the base class for structural constraints used by learning algorithms
24
* that learn an undirected graph structure
25
*
26
* @author Christophe GONZALES(@AMU) and Pierre-Henri WUILLEMIN(@LIP6)
27
*/
28
29
#
include
<
agrum
/
BN
/
learning
/
constraints
/
structuralConstraintUndiGraph
.
h
>
30
31
/// include the inlined functions if necessary
32
#
ifdef
GUM_NO_INLINE
33
#
include
<
agrum
/
BN
/
learning
/
constraints
/
structuralConstraintUndiGraph_inl
.
h
>
34
#
endif
/* GUM_NO_INLINE */
35
36
namespace
gum
{
37
38
namespace
learning
{
39
40
/// default constructor
41
StructuralConstraintUndiGraph
::
StructuralConstraintUndiGraph
() {
42
GUM_CONSTRUCTOR
(
StructuralConstraintUndiGraph
);
43
}
44
45
/// constructor starting with an empty graph with a given number of nodes
46
StructuralConstraintUndiGraph
::
StructuralConstraintUndiGraph
(
Size
nb_nodes
) {
47
setGraph
(
nb_nodes
);
48
GUM_CONSTRUCTOR
(
StructuralConstraintUndiGraph
);
49
}
50
51
/// constructor starting with a given graph
52
StructuralConstraintUndiGraph
::
StructuralConstraintUndiGraph
(
const
UndiGraph
&
graph
) {
53
setGraph
(
graph
);
54
GUM_CONSTRUCTOR
(
StructuralConstraintUndiGraph
);
55
}
56
57
/// copy constructor
58
StructuralConstraintUndiGraph
::
StructuralConstraintUndiGraph
(
59
const
StructuralConstraintUndiGraph
&
from
) :
60
_UndiGraph_graph_
(
from
.
_UndiGraph_graph_
) {
61
GUM_CONS_CPY
(
StructuralConstraintUndiGraph
);
62
}
63
64
/// move constructor
65
StructuralConstraintUndiGraph
::
StructuralConstraintUndiGraph
(
66
StructuralConstraintUndiGraph
&&
from
) :
67
_UndiGraph_graph_
(
std
::
move
(
from
.
_UndiGraph_graph_
)) {
68
GUM_CONS_MOV
(
StructuralConstraintUndiGraph
);
69
}
70
71
/// destructor
72
StructuralConstraintUndiGraph
::~
StructuralConstraintUndiGraph
() {
73
GUM_DESTRUCTOR
(
StructuralConstraintUndiGraph
);
74
}
75
76
/// copy operator
77
StructuralConstraintUndiGraph
&
78
StructuralConstraintUndiGraph
::
operator
=(
const
StructuralConstraintUndiGraph
&
from
) {
79
if
(
this
!= &
from
) {
_UndiGraph_graph_
=
from
.
_UndiGraph_graph_
; }
80
return
*
this
;
81
}
82
83
/// move operator
84
StructuralConstraintUndiGraph
&
85
StructuralConstraintUndiGraph
::
operator
=(
StructuralConstraintUndiGraph
&&
from
) {
86
if
(
this
!= &
from
) {
_UndiGraph_graph_
=
std
::
move
(
from
.
_UndiGraph_graph_
); }
87
return
*
this
;
88
}
89
90
}
/* namespace learning */
91
92
}
/* namespace gum */
gum::Set::emplace
INLINE void emplace(Args &&... args)
Definition:
set_tpl.h:643
gum::learning::genericBNLearner::Database::Database
Database(const std::string &filename, const BayesNet< GUM_SCALAR > &bn, const std::vector< std::string > &missing_symbols)
Definition:
genericBNLearner_tpl.h:31