aGrUM
3.2.0
a C++ library for (probabilistic) graphical models
Toggle main menu visibility
structuralConstraintUndiGraph.h
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
#ifndef GUM_LEARNING_STRUCTURAL_CONSTRAINT_UNDIGRAPH_H
49
#define GUM_LEARNING_STRUCTURAL_CONSTRAINT_UNDIGRAPH_H
50
51
#include <
agrum/agrum.h
>
52
53
#include <
agrum/base/graphs/undiGraph.h
>
54
#include <
agrum/BN/learning/constraints/structuralConstraint.h
>
55
56
namespace
gum
{
57
58
namespace
learning
{
59
69
class
GUM_PUBLIC_BN
StructuralConstraintUndiGraph
:
public
virtual
StructuralConstraintEmpty
{
70
public
:
71
// ##########################################################################
73
// ##########################################################################
75
77
StructuralConstraintUndiGraph
();
78
80
StructuralConstraintUndiGraph
(
Size
nb_nodes);
81
83
StructuralConstraintUndiGraph
(
const
UndiGraph
&
graph
);
84
86
StructuralConstraintUndiGraph
(
const
StructuralConstraintUndiGraph
& from);
87
89
StructuralConstraintUndiGraph
(
StructuralConstraintUndiGraph
&& from);
90
92
virtual
~StructuralConstraintUndiGraph
();
93
95
96
// ##########################################################################
98
// ##########################################################################
100
102
StructuralConstraintUndiGraph
&
operator=
(
const
StructuralConstraintUndiGraph
& from);
103
105
StructuralConstraintUndiGraph
&
operator=
(
StructuralConstraintUndiGraph
&& from);
106
108
109
// ##########################################################################
111
// ##########################################################################
113
115
void
setGraph
(
Size
nb_nodes);
116
118
void
setGraphAlone
(
const
UndiGraph
&
graph
);
119
121
125
void
modifyGraphAlone
(
const
EdgeAddition
& change);
126
128
130
void
modifyGraphAlone
(
const
EdgeDeletion
& change);
131
133
138
void
modifyGraphAlone
(
const
GraphChange
& change);
139
141
153
bool
isAlwaysInvalidAlone
(
const
GraphChange
& change)
const
;
154
156
158
bool
checkEdgeAdditionAlone
(
NodeId
x,
NodeId
y)
const
;
159
161
162
bool
checkEdgeDeletionAlone
(
NodeId
x,
NodeId
y)
const
;
163
165
168
bool
checkModificationAlone
(
const
GraphChange
& change)
const
;
169
171
173
bool
checkModificationAlone
(
const
EdgeAddition
& change)
const
;
174
176
177
bool
checkModificationAlone
(
const
EdgeDeletion
& change)
const
;
178
180
181
#ifndef DOXYGEN_SHOULD_SKIP_THIS
182
// include the set of methods that enable the structural constraint to
183
// be standalone, i.e., that it needs not be included into a
184
// StructuralConstraintSetStatic to be used by learning algorithms
185
# define GUM_CONSTRAINT_CLASS_NAME StructuralConstraintUndiGraph
186
# include <
agrum/BN/learning/constraints/structuralConstraintPattern4UndiGraphHeader.h
>
187
# undef GUM_CONSTRAINT_CLASS_NAME
188
#endif
// DOXYGEN_SHOULD_SKIP_THIS
189
190
protected
:
192
UndiGraph
_UndiGraph_graph_
;
193
};
194
195
}
/* namespace learning */
196
197
}
/* namespace gum */
198
200
#ifndef GUM_NO_INLINE
201
# include <
agrum/BN/learning/constraints/structuralConstraintUndiGraph_inl.h
>
202
#endif
/* GUM_NO_INLINE */
203
204
#endif
/* GUM_LEARNING_STRUCTURAL_CONSTRAINT_UNDIGRAPH_H */
agrum.h
gum::UndiGraph
Base class for undirected graphs.
Definition
undiGraph.h:130
gum::learning::EdgeAddition
The class for notifying learning algorithms of new edge additions.
Definition
graphChange.h:518
gum::learning::EdgeDeletion
The class for notifying learning algorithms of edge removals.
Definition
graphChange.h:571
gum::learning::GraphChange
Definition
graphChange.h:101
gum::learning::StructuralConstraintUndiGraph::checkEdgeDeletionAlone
bool checkEdgeDeletionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to remove edge (x,y)
gum::learning::StructuralConstraintUndiGraph::_UndiGraph_graph_
UndiGraph _UndiGraph_graph_
the UndiGraph on which we perform checks
Definition
structuralConstraintUndiGraph.h:192
gum::learning::StructuralConstraintUndiGraph::setGraphAlone
void setGraphAlone(const UndiGraph &graph)
sets a new graph from which we will perform checkings
gum::learning::StructuralConstraintUndiGraph::modifyGraphAlone
void modifyGraphAlone(const GraphChange &change)
notify the constraint of a modification of the graph
gum::learning::StructuralConstraintUndiGraph::modifyGraphAlone
void modifyGraphAlone(const EdgeAddition &change)
notify the constraint of a modification of the graph
gum::learning::StructuralConstraintUndiGraph::modifyGraphAlone
void modifyGraphAlone(const EdgeDeletion &change)
notify the constraint of a modification of the graph
gum::learning::StructuralConstraintUndiGraph::checkEdgeAdditionAlone
bool checkEdgeAdditionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to add edge (x,y)
gum::learning::StructuralConstraintUndiGraph::operator=
StructuralConstraintUndiGraph & operator=(const StructuralConstraintUndiGraph &from)
copy operator
Definition
structuralConstraintUndiGraph.cpp:97
gum::learning::StructuralConstraintUndiGraph::checkModificationAlone
bool checkModificationAlone(const EdgeDeletion &change) const
checks whether the constraints enable to remove an edge
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::learning::StructuralConstraintUndiGraph::isAlwaysInvalidAlone
bool isAlwaysInvalidAlone(const GraphChange &change) const
indicates whether a change will always violate the constraint
gum::learning::StructuralConstraintUndiGraph::checkModificationAlone
bool checkModificationAlone(const EdgeAddition &change) const
checks whether the constraints enable to add an edge
gum::learning::StructuralConstraintUndiGraph::checkModificationAlone
bool checkModificationAlone(const GraphChange &change) const
checks whether the constraints enable to perform a graph change
gum::Size
std::size_t Size
In aGrUM, hashed values are unsigned long int.
Definition
types.h:74
gum::NodeId
Size NodeId
Type for node ids.
Definition
graphElements.h:117
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
gum::learning::StructuralConstraintEmpty
the base class for all structural constraints
Definition
structuralConstraint.h:60
structuralConstraintPattern4UndiGraphHeader.h
structuralConstraintUndiGraph_inl.h
the base class for structural constraints used by learning algorithms that learn an undirected graph ...
structuralConstraint.h
the base class for all structural constraints
undiGraph.h
Base classes for undirected graphs.
aGrUM
3.2.0
© PHW&CG&others - 2022
DoXyGeN 1.18.0