aGrUM 2.3.2
a C++ library for (probabilistic) graphical models
structuralConstraintIndegree.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_INDEGREE_H
49#define GUM_LEARNING_STRUCTURAL_CONSTRAINT_INDEGREE_H
50
51#include <limits>
52
53#include <agrum/agrum.h>
54
56
57namespace gum {
58
59 namespace learning {
60
69 protected virtual StructuralConstraintSetStatic< StructuralConstraintDiGraph > {
70 public:
71 // ##########################################################################
73 // ##########################################################################
75
78
80 StructuralConstraintIndegree(Size nb_nodes, Size max_indegree);
81
83 StructuralConstraintIndegree(const DiGraph& graph, Size max_indegree);
84
87
90
93
95
96 // ##########################################################################
98 // ##########################################################################
100
103
106
108
109 // ##########################################################################
111 // ##########################################################################
113
115 void setIndegree(const NodeProperty< Size >& max_indegree);
116
119 void setMaxIndegree(Size max_indegree, bool update_all_node = false);
120
122 void setGraphAlone(const DiGraph& graph);
123
125
131 void modifyGraphAlone(const ArcAddition& change);
132
134
136 void modifyGraphAlone(const ArcDeletion& change);
137
139
145 void modifyGraphAlone(const ArcReversal& change);
146
148
154 void modifyGraphAlone(const GraphChange& change);
155
157
170 bool isAlwaysInvalidAlone(const GraphChange& change) const;
171
173
177
179
181
183
187
189
192 bool checkModificationAlone(const ArcAddition& change) const;
193
195
196 bool checkModificationAlone(const ArcDeletion& change) const;
197
199
202 bool checkModificationAlone(const ArcReversal& change) const;
203
205
212 bool checkModificationAlone(const GraphChange& change) const;
213
215
217
218#ifndef DOXYGEN_SHOULD_SKIP_THIS
219// include the set of methods that enable the structural constraint to
220// be standalone, i.e., that it needs not be included into a
221// StructuralConstraintSetStatic to be used by learning algorithms
222# define GUM_CONSTRAINT_CLASS_NAME StructuralConstraintIndegree
224# undef GUM_CONSTRAINT_CLASS_NAME
225#endif // DOXYGEN_SHOULD_SKIP_THIS
226
227 protected:
230
232 Size _Indegree_max_indegree_{std::numeric_limits< Size >::max()};
233 };
234
235 } /* namespace learning */
236
237} /* namespace gum */
238
240#ifndef GUM_NO_INLINE
242#endif /* GUM_NO_INLINE */
243
244#endif /* GUM_LEARNING_STRUCTURAL_CONSTRAINT_INDEGREE_H */
Base class for all oriented graphs.
Definition diGraph.h:130
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 GraphChange &change) const
checks whether the constraints enable to perform a graph change
Size _Indegree_max_indegree_
a default max indegree to assign for nodes without specified indegree
bool checkModificationAlone(const ArcAddition &change) const
checks whether the constraints enable to add an arc
void setMaxIndegree(Size max_indegree, bool update_all_node=false)
resets the default max indegree and possibly updates the indegree of all nodes
void modifyGraphAlone(const ArcAddition &change)
notify the constraint of a modification of the graph
StructuralConstraintIndegree & operator=(const StructuralConstraintIndegree &from)
copy operator
bool checkModificationAlone(const ArcDeletion &change) const
checks whether the constraints enable to remove an arc
void modifyGraphAlone(const ArcDeletion &change)
notify the constraint of a modification of the graph
bool isAlwaysInvalidAlone(const GraphChange &change) const
indicates whether a change will always violate the constraint
bool checkModificationAlone(const ArcReversal &change) const
checks whether the constraints enable to reverse an arc
bool checkArcDeletionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to remove arc (x,y)
void setIndegree(const NodeProperty< Size > &max_indegree)
sets the default max indegree for all the nodes in the property
void setGraphAlone(const DiGraph &graph)
sets a new graph from which we will perform checkings
Size maxIndegree() const
sets the default max indegree for all the nodes in the property
bool checkArcReversalAlone(NodeId x, NodeId y) const
checks whether the constraints enable to reverse arc (x,y)
NodeProperty< Size > _Indegree_max_parents_
the max number of parents per node
bool checkArcAdditionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to add arc (x,y)
void modifyGraphAlone(const ArcReversal &change)
notify the constraint of a modification of the graph
void modifyGraphAlone(const GraphChange &change)
notify the constraint of a modification of the graph
std::size_t Size
In aGrUM, hashed values are unsigned long int.
Definition types.h:74
Size NodeId
Type for node ids.
HashTable< NodeId, VAL > NodeProperty
Property on graph elements.
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 structural constraints used by learning algorithms that learn a directed graph str...
the class for structural constraints limiting the number of parents of nodes in a directed graph