aGrUM 3.1.1
a C++ library for (probabilistic) graphical models
structuralConstraintDAG.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
47#ifndef GUM_LEARNING_STRUCTURAL_CONSTRAINT_DAG_H
48#define GUM_LEARNING_STRUCTURAL_CONSTRAINT_DAG_H
49
50#include <atomic>
51
52#include <agrum/agrum.h>
53
56
57namespace gum {
58
59 namespace learning {
60
70 public:
71 // ##########################################################################
73 // ##########################################################################
75
78
81
84
87
90
93
95
96 // ##########################################################################
98 // ##########################################################################
100
103
106
108
109 // ##########################################################################
111 // ##########################################################################
113
115 void setGraphAlone(const DiGraph& graph);
116
118 void setGraphAlone(Size nb_nodes);
119
121
128 void modifyGraphAlone(const ArcAddition& change);
129
131
133 void modifyGraphAlone(const ArcDeletion& change);
134
136
143 void modifyGraphAlone(const ArcReversal& change);
144
146
150
152
156
158
165 void modifyGraphAlone(const GraphChange& change);
166
168
181 bool isAlwaysInvalidAlone(const GraphChange& change) const;
182
184
188
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
213 bool checkModificationAlone(const ArcAddition& change) const;
214
216
217 bool checkModificationAlone(const ArcDeletion& change) const;
218
220
222 bool checkModificationAlone(const ArcReversal& change) const;
223
225
229
231
235
236
238
243 bool checkModificationAlone(const GraphChange& change) const;
244
246 void setGraph(const DAG& graph);
247
249 void setGraph(Size nb_nodes);
250
252
253#ifndef DOXYGEN_SHOULD_SKIP_THIS
254// include the set of methods that enable the structural constraint to
255// be standalone, i.e., that it needs not be included into a
256// StructuralConstraintSetStatic to be used by learning algorithms
257# define GUM_CONSTRAINT_CLASS_NAME StructuralConstraintDAG
259# undef GUM_CONSTRAINT_CLASS_NAME
260#endif // DOXYGEN_SHOULD_SKIP_THIS
261
262 private:
263 // the DiGraph on which we perform checks: it is better to use a DiGraph
264 // here rather than a DAG because this will speed-up checking triangle
265 // deletions (not enforcing checking the acyclicity for some graph
266 // operations in which we know for sure that the graph cannot contain any
267 // directed cycle)
269
270 // in order to check for directed acyclicity when performing operations
271 // like arc reversals or triangle deletions, we will perform modifications
272 // on _graph_. This will simplify the checking. In order to guaranty that
273 // several threads do not mess with _graph_ (data races) or simply that
274 // their computations are correct, we will use a spinlock. This should be
275 // efficient because, usually, only 1 thread will perform these operations
276 // at a time.
277 mutable std::atomic_flag _lock_flag_ = ATOMIC_FLAG_INIT;
278
280 void _lock_() const;
281
283 void _unlock_() const;
284 };
285
286 } /* namespace learning */
287
288} /* namespace gum */
289
291#ifndef GUM_NO_INLINE
293#endif /* GUM_NO_INLINE */
294
295#endif /* GUM_LEARNING_STRUCTURAL_CONSTRAINT_DAG_H */
Base classes for directed acyclic graphs.
Base class for dag.
Definition DAG.h:121
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 _unlock_() const
the methode to release a critical region used to modify graph
bool checkModificationAlone(const ArcTriangleDeletion1 &change) const
checks whether the constraints enable to apply an ArcTriangleDeletion1
bool isAlwaysInvalidAlone(const GraphChange &change) const
indicates whether a change will always violate the constraint
StructuralConstraintDAG & operator=(const StructuralConstraintDAG &from)
copy operator
bool checkModificationAlone(const ArcDeletion &change) const
checks whether the constraints enable to remove an arc
void modifyGraphAlone(const ArcTriangleDeletion1 &change)
notify the constraint of a modification of the graph
void setGraph(const DAG &graph)
sets a new graph from which we will perform checking
void modifyGraphAlone(const ArcReversal &change)
notify the constraint of a modification of the graph
void modifyGraphAlone(const ArcAddition &change)
notify the constraint of a modification of the graph
bool checkArcAdditionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to add arc (x,y)
bool checkArcReversalAlone(NodeId x, NodeId y) const
checks whether the constraints enable to reverse arc (x,y)
bool checkModificationAlone(const ArcAddition &change) const
checks whether the constraints enable to add an arc
void setGraphAlone(const DiGraph &graph)
sets a new graph from which we will perform checking
void setGraphAlone(Size nb_nodes)
sets a new empty graph from which we will perform checking
bool checkArcTriangleDeletion1Alone(NodeId node1, NodeId node2, NodeId node3) const
checks whether the constraints enable to apply an ArcTriangleDeletion1
void modifyGraphAlone(const ArcTriangleDeletion2 &change)
notify the constraint of a modification of the graph
void setGraph(Size nb_nodes)
sets a new empty graph from which we will perform checking
void _lock_() const
the method to lock a critical region in order to modify graph
bool checkArcTriangleDeletion2Alone(NodeId node1, NodeId node2, NodeId node3) const
checks whether the constraints enable to apply an ArcTriangleDeletion2
bool checkModificationAlone(const ArcReversal &change) const
checks whether the constraints enable to reverse an arc
bool checkModificationAlone(const ArcTriangleDeletion2 &change) const
checks whether the constraints enable to apply an ArcTriangleDeletion2
void modifyGraphAlone(const ArcDeletion &change)
notify the constraint of a modification of the graph
bool checkArcDeletionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to remove arc (x,y)
std::size_t Size
In aGrUM, hashed values are unsigned long int.
Definition types.h:74
Size NodeId
Type for node ids.
include the inlined functions if necessary
Definition CSVParser.h:55
gum is the global namespace for all aGrUM entities
Definition agrum.h:46
the base class for all structural constraints
the base class for structural constraints imposed by DAGs
the base class for all structural constraints