aGrUM 3.1.1
a C++ library for (probabilistic) graphical models
structuralConstraintForbiddenArcs.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_FORBIDDEN_ARCS_H
49#define GUM_LEARNING_STRUCTURAL_CONSTRAINT_FORBIDDEN_ARCS_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 setArcs(const ArcSet& set);
108
110 void addArc(const Arc& arc);
111
113 void eraseArc(const Arc& arc);
114
116 const ArcSet& arcs() const;
117
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
147
151
153
157 void modifyGraphAlone(const GraphChange& change);
158
160
173 bool isAlwaysInvalidAlone(const GraphChange& change) const;
174
176
179
181
183
185
188
190
193 bool checkArcTriangleDeletion1Alone(NodeId node1, NodeId node2, NodeId node3) const;
194
196
199 bool checkArcTriangleDeletion2Alone(NodeId node1, NodeId node2, NodeId node3) const;
200
202
207 bool checkModificationAlone(const GraphChange& change) const;
208
210
212 bool checkModificationAlone(const ArcAddition& change) const;
213
215
216 bool checkModificationAlone(const ArcDeletion& change) const;
217
219
221 bool checkModificationAlone(const ArcReversal& change) const;
222
224
228
230
234
236
237#ifndef DOXYGEN_SHOULD_SKIP_THIS
238// include the set of methods that enable the structural constraint to
239// be standalone, i.e., that it needs not be included into a
240// StructuralConstraintSetStatic to be used by learning algorithms
241# define GUM_CONSTRAINT_CLASS_NAME StructuralConstraintForbiddenArcs
243# undef GUM_CONSTRAINT_CLASS_NAME
244#endif // DOXYGEN_SHOULD_SKIP_THIS
245
246 protected:
249 };
250
251 } /* namespace learning */
252
253} /* namespace gum */
254
256#ifndef GUM_NO_INLINE
258#endif /* GUM_NO_INLINE */
259
260#endif /* GUM_LEARNING_STRUCTURAL_CONSTRAINT_FORBIDDEN_ARCS_H */
The base class for all directed edges.
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 setGraphAlone(const DiGraph &graph)
sets a new graph from which we will perform checkings
bool checkModificationAlone(const GraphChange &change) const
checks whether the constraints enable to perform a graph change
bool checkArcTriangleDeletion2Alone(NodeId node1, NodeId node2, NodeId node3) const
checks whether the constraints enable to apply an ArcTriangleDeletion2
ArcSet _forbidden_arcs_
the ForbiddenArcs on which we perform checks
bool checkModificationAlone(const ArcReversal &change) const
checks whether the constraints enable to reverse an arc
void addArc(const Arc &arc)
assign a new forbidden arc
void modifyGraphAlone(const ArcDeletion &change)
notify the constraint of a modification of the graph
StructuralConstraintForbiddenArcs & operator=(const StructuralConstraintForbiddenArcs &from)
copy operator
bool checkArcReversalAlone(NodeId x, NodeId y) const
checks whether the constraints enable to reverse arc (x,y)
const ArcSet & arcs() const
returns the set of mandatory arcs
bool checkArcTriangleDeletion1Alone(NodeId node1, NodeId node2, NodeId node3) const
checks whether the constraints enable to apply an ArcTriangleDeletion1
void modifyGraphAlone(const ArcAddition &change)
notify the constraint of a modification of the graph
bool checkModificationAlone(const ArcAddition &change) const
checks whether the constraints enable to add an arc
bool isAlwaysInvalidAlone(const GraphChange &change) const
indicates whether a change will always violate the constraint
void modifyGraphAlone(const ArcTriangleDeletion2 &change)
notify the constraint of a modification of the graph
bool checkModificationAlone(const ArcDeletion &change) const
checks whether the constraints enable to remove an arc
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
bool checkArcDeletionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to remove arc (x,y)
bool checkModificationAlone(const ArcTriangleDeletion1 &change) const
checks whether the constraints enable to apply an ArcTriangleDeletion1
void eraseArc(const Arc &arc)
remove a forbidden arc
bool checkModificationAlone(const ArcTriangleDeletion2 &change) const
checks whether the constraints enable to apply an ArcTriangleDeletion2
void modifyGraphAlone(const GraphChange &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)
void setArcs(const ArcSet &set)
assign a set of forbidden arcs
Size NodeId
Type for node ids.
Set< Arc > ArcSet
Some typdefs and define for shortcuts ...
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 structural constraint for forbidding the creation of some arcs during structure learning
the base class for all structural constraints