aGrUM 2.3.2
a C++ library for (probabilistic) graphical models
structuralConstraintPossibleEdges.h
Go to the documentation of this file.
1/****************************************************************************
2 * This file is part of the aGrUM/pyAgrum library. *
3 * *
4 * Copyright (c) 2005-2025 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-2025 *
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_POSSIBLE_EDGES_H
49#define GUM_LEARNING_STRUCTURAL_CONSTRAINT_POSSIBLE_EDGES_H
50
51#include <agrum/agrum.h>
52
54
55namespace gum {
56
57 namespace learning {
58
65 public:
66 // ##########################################################################
68 // ##########################################################################
70
73
76
79
82
85
87
88 // ##########################################################################
90 // ##########################################################################
92
95
98
100
101 // ##########################################################################
103 // ##########################################################################
105
107 void setEdges(const EdgeSet& set);
108
110 void addEdge(const Edge& edge);
111
113 void eraseEdge(const Edge& edge);
114
116 const EdgeSet& edges() const;
117
119 void setGraphAlone(const DiGraph& graph);
120
122
126 void modifyGraphAlone(const ArcAddition& change);
127
129
131 void modifyGraphAlone(const ArcDeletion& change);
132
134
138 void modifyGraphAlone(const ArcReversal& change);
139
141
145 void modifyGraphAlone(const GraphChange& change);
146
148
161 bool isAlwaysInvalidAlone(const GraphChange& change) const;
162
164
167
169
171
173
176
178
183 bool checkModificationAlone(const GraphChange& change) const;
184
186
188 bool checkModificationAlone(const ArcAddition& change) const;
189
191
192 bool checkModificationAlone(const ArcDeletion& change) const;
193
195
197 bool checkModificationAlone(const ArcReversal& change) const;
198
200
201#ifndef DOXYGEN_SHOULD_SKIP_THIS
202// include the set of methods that enable the structural constraint to
203// be standalone, i.e., that it needs not be included into a
204// StructuralConstraintSetStatic to be used by learning algorithms
205# define GUM_CONSTRAINT_CLASS_NAME StructuralConstraintPossibleEdges
207# undef GUM_CONSTRAINT_CLASS_NAME
208#endif // DOXYGEN_SHOULD_SKIP_THIS
209
210 protected:
213 };
214
215 } /* namespace learning */
216
217} /* namespace gum */
218
220#ifndef GUM_NO_INLINE
222#endif /* GUM_NO_INLINE */
223
224#endif /* GUM_LEARNING_STRUCTURAL_CONSTRAINT_POSSIBLE_EDGES_H */
Base class for all oriented graphs.
Definition diGraph.h:130
The base class for all undirected edges.
The class for notifying learning algorithms of new arc additions.
The class for notifying learning algorithms of arc removals.
The class for notifying learning algorithms of arc reversals.
bool checkModificationAlone(const ArcReversal &change) const
checks whether the constraints enable to reverse an arc
void modifyGraphAlone(const ArcDeletion &change)
notify the constraint of a modification of the graph
void modifyGraphAlone(const GraphChange &change)
notify the constraint of a modification of the graph
bool checkArcReversalAlone(NodeId x, NodeId y) const
checks whether the constraints enable to reverse arc (x,y)
bool isAlwaysInvalidAlone(const GraphChange &change) const
indicates whether a change will always violate the constraint
bool checkModificationAlone(const ArcDeletion &change) const
checks whether the constraints enable to remove an arc
bool checkModificationAlone(const GraphChange &change) const
checks whether the constraints enable to perform a graph change
bool checkModificationAlone(const ArcAddition &change) const
checks whether the constraints enable to add an arc
EdgeSet _PossibleEdges_possible_edges_
the PossibleEdges on which we perform checks
void addEdge(const Edge &edge)
assign a new forbidden arc
void setGraphAlone(const DiGraph &graph)
sets a new graph from which we will perform checkings
StructuralConstraintPossibleEdges & operator=(const StructuralConstraintPossibleEdges &from)
copy operator
bool checkArcAdditionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to add arc (x,y)
void setEdges(const EdgeSet &set)
assign a set of forbidden arcs
const EdgeSet & edges() const
returns the set of mandatory arcs
void modifyGraphAlone(const ArcReversal &change)
notify the constraint of a modification of the graph
void eraseEdge(const Edge &edge)
remove a forbidden arc
bool checkArcDeletionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to remove arc (x,y)
void modifyGraphAlone(const ArcAddition &change)
notify the constraint of a modification of the graph
Set< Edge > EdgeSet
Some typdefs and define for shortcuts ...
Size NodeId
Type for node ids.
include the inlined functions if necessary
Definition CSVParser.h:54
gum is the global namespace for all aGrUM entities
Definition agrum.h:46
the base class for all structural constraints
the structural constraint for forbidding the creation of some arcs during structure learning
the base class for all structural constraints