aGrUM 3.1.1
a C++ library for (probabilistic) graphical models
structuralConstraintDiGraph.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_DIGRAPH_H
49#define GUM_LEARNING_STRUCTURAL_CONSTRAINT_DIGRAPH_H
50
51#include <agrum/agrum.h>
52
54
55namespace gum {
56
57 namespace learning {
58
69 public:
70 // ##########################################################################
72 // ##########################################################################
74
77
80
83
86
89
92
94
95 // ##########################################################################
97 // ##########################################################################
99
102
105
107
108 // ##########################################################################
110 // ##########################################################################
112
114 void setGraph(Size nb_nodes);
115
118
120
124 void modifyGraphAlone(const ArcAddition& change);
125
127
129 void modifyGraphAlone(const ArcDeletion& change);
130
132
136 void modifyGraphAlone(const ArcReversal& change);
137
139
143
145
149
151
155 void modifyGraphAlone(const GraphChange& change);
156
158
171 bool isAlwaysInvalidAlone(const GraphChange& change) const;
172
174
177
179
181
183
186
188
191 bool checkArcTriangleDeletion1Alone(NodeId node1, NodeId node2, NodeId node3) const;
192
194
197 bool checkArcTriangleDeletion2Alone(NodeId node1, NodeId node2, NodeId node3) const;
198
200
205 bool checkModificationAlone(const GraphChange& change) const;
206
208
210 bool checkModificationAlone(const ArcAddition& change) const;
211
213
214 bool checkModificationAlone(const ArcDeletion& change) const;
215
217
219 bool checkModificationAlone(const ArcReversal& change) const;
220
222
226
228
232
234
235#ifndef DOXYGEN_SHOULD_SKIP_THIS
236// include the set of methods that enable the structural constraint to
237// be standalone, i.e., that it needs not be included into a
238// StructuralConstraintSetStatic to be used by learning algorithms
239# define GUM_CONSTRAINT_CLASS_NAME StructuralConstraintDiGraph
241# undef GUM_CONSTRAINT_CLASS_NAME
242#endif // DOXYGEN_SHOULD_SKIP_THIS
243
244 protected:
247 };
248
249 } /* namespace learning */
250
251} /* namespace gum */
252
254#ifndef GUM_NO_INLINE
256#endif /* GUM_NO_INLINE */
257
258#endif /* GUM_LEARNING_STRUCTURAL_CONSTRAINT_DIGRAPH_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 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 ArcAddition &change) const
checks whether the constraints enable to add an arc
StructuralConstraintDiGraph & operator=(const StructuralConstraintDiGraph &from)
copy operator
bool checkModificationAlone(const ArcReversal &change) const
checks whether the constraints enable to reverse an arc
void modifyGraphAlone(const ArcTriangleDeletion2 &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 ArcAddition &change)
notify the constraint of a modification of the graph
void modifyGraphAlone(const ArcReversal &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)
bool checkArcReversalAlone(NodeId x, NodeId y) const
checks whether the constraints enable to reverse arc (x,y)
bool checkArcTriangleDeletion1Alone(NodeId node1, NodeId node2, NodeId node3) const
checks whether the constraints enable to apply an ArcTriangleDeletion1
bool checkModificationAlone(const ArcDeletion &change) const
checks whether the constraints enable to remove an arc
bool checkArcTriangleDeletion2Alone(NodeId node1, NodeId node2, NodeId node3) const
checks whether the constraints enable to apply an ArcTriangleDeletion2
void setGraph(Size nb_nodes)
sets a new empty graph from which we will perform checking
bool checkModificationAlone(const ArcTriangleDeletion1 &change) const
checks whether the constraints enable to apply an ArcTriangleDeletion1
DiGraph _graph_
the DiGraph on which we perform checks
void setGraphAlone(const DiGraph &graph)
sets a new graph from which we will perform checking
bool checkArcAdditionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to add arc (x,y)
bool checkModificationAlone(const ArcTriangleDeletion2 &change) const
checks whether the constraints enable to apply an ArcTriangleDeletion2
bool checkModificationAlone(const GraphChange &change) const
checks whether the constraints enable to perform a graph change
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 used by learning algorithms that learn a directed graph str...
the base class for all structural constraints