aGrUM 3.1.1
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-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_INDEGREE_H
49#define GUM_LEARNING_STRUCTURAL_CONSTRAINT_INDEGREE_H
50
51#include <limits>
52
53#include <agrum/agrum.h>
54
56
57namespace gum::learning {
58
67 protected virtual StructuralConstraintSetStatic< StructuralConstraintDiGraph > {
68 public:
69 // ##########################################################################
71 // ##########################################################################
73
76
78 StructuralConstraintIndegree(Size nb_nodes, Size max_indegree);
79
81 StructuralConstraintIndegree(const DiGraph& graph, Size max_indegree);
82
85
88
91
93
94 // ##########################################################################
96 // ##########################################################################
98
101
104
106
107 // ##########################################################################
109 // ##########################################################################
111
113 void setIndegree(const NodeProperty< Size >& max_indegree);
114
117 void setMaxIndegree(Size max_indegree, bool update_all_node = false);
118
121
123
129 void modifyGraphAlone(const ArcAddition& change);
130
132
134 void modifyGraphAlone(const ArcDeletion& change);
135
137
143 void modifyGraphAlone(const ArcReversal& change);
144
146
150
152
156
158
164 void modifyGraphAlone(const GraphChange& change);
165
167
180 bool isAlwaysInvalidAlone(const GraphChange& change) const;
181
183
187
189
191
193
197
199
202 bool checkArcTriangleDeletion1Alone(NodeId node1, NodeId node2, NodeId node3) const;
203
205
208 bool checkArcTriangleDeletion2Alone(NodeId node1, NodeId node2, NodeId node3) const;
209
211
214 bool checkModificationAlone(const ArcAddition& change) const;
215
217
218 bool checkModificationAlone(const ArcDeletion& change) const;
219
221
224 bool checkModificationAlone(const ArcReversal& change) const;
225
227
231
233
237
239
246 bool checkModificationAlone(const GraphChange& change) const;
247
249
251
252#ifndef DOXYGEN_SHOULD_SKIP_THIS
253// include the set of methods that enable the structural constraint to
254// be standalone, i.e., that it needs not be included into a
255// StructuralConstraintSetStatic to be used by learning algorithms
256# define GUM_CONSTRAINT_CLASS_NAME StructuralConstraintIndegree
258# undef GUM_CONSTRAINT_CLASS_NAME
259#endif // DOXYGEN_SHOULD_SKIP_THIS
260
261 protected:
264
266 Size _Indegree_max_indegree_{std::numeric_limits< Size >::max()};
267 };
268
269} // namespace gum::learning
270
272#ifndef GUM_NO_INLINE
274#endif /* GUM_NO_INLINE */
275
276#endif /* GUM_LEARNING_STRUCTURAL_CONSTRAINT_INDEGREE_H */
Base class for all oriented graphs.
Definition diGraph.h:132
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.
The graph change substituting a triangle node1->node2->node3 + node1->node3 into v-structure node2->n...
The graph change substituting a triangle node1->node2->node3 + node1->node3 into v-structure node1->n...
void modifyGraphAlone(const ArcTriangleDeletion2 &change)
notify the constraint of a modification of the graph
bool checkModificationAlone(const ArcTriangleDeletion1 &change) const
checks whether the constraints enable to apply an ArcTriangleDeletion1
Size _Indegree_max_indegree_
a default max indegree to assign for nodes without specified indegree
bool checkArcTriangleDeletion1Alone(NodeId node1, NodeId node2, NodeId node3) const
checks whether the constraints enable to apply an ArcTriangleDeletion1
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 checkModificationAlone(const ArcTriangleDeletion2 &change) const
checks whether the constraints enable to apply an ArcTriangleDeletion2
bool checkArcAdditionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to add arc (x,y)
bool checkArcTriangleDeletion2Alone(NodeId node1, NodeId node2, NodeId node3) const
checks whether the constraints enable to apply an ArcTriangleDeletion2
void modifyGraphAlone(const ArcReversal &change)
notify the constraint of a modification of the graph
void modifyGraphAlone(const ArcTriangleDeletion1 &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:55
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