aGrUM 3.2.0
a C++ library for (probabilistic) graphical models
structuralConstraintPossibleEdges.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_POSSIBLE_EDGES_H
49#define GUM_LEARNING_STRUCTURAL_CONSTRAINT_POSSIBLE_EDGES_H
50
51#include <agrum/agrum.h>
52
54
55namespace gum {
56
57 namespace learning {
58
65 public virtual StructuralConstraintEmpty {
66 public:
67 // ##########################################################################
69 // ##########################################################################
71
74
77
80
83
86
88
89 // ##########################################################################
91 // ##########################################################################
93
96
99
101
102 // ##########################################################################
104 // ##########################################################################
106
108 void setEdges(const EdgeSet& set);
109
111 void addEdge(const Edge& edge);
112
114 void eraseEdge(const Edge& edge);
115
117 const EdgeSet& edges() const;
118
121
123
127 void modifyGraphAlone(const ArcAddition& change);
128
130
132 void modifyGraphAlone(const ArcDeletion& change);
133
135
139 void modifyGraphAlone(const ArcReversal& change);
140
142
146
148
152
154
158 void modifyGraphAlone(const GraphChange& change);
159
161
174 bool isAlwaysInvalidAlone(const GraphChange& change) const;
175
177
180
182
184
186
189
191
194 bool checkArcTriangleDeletion1Alone(NodeId node1, NodeId node2, NodeId node3) const;
195
197
200 bool checkArcTriangleDeletion2Alone(NodeId node1, NodeId node2, NodeId node3) const;
201
202
204
209 bool checkModificationAlone(const GraphChange& change) const;
210
212
214 bool checkModificationAlone(const ArcAddition& change) const;
215
217
218 bool checkModificationAlone(const ArcDeletion& change) const;
219
221
223 bool checkModificationAlone(const ArcReversal& change) const;
224
226
230
232
236
238
239#ifndef DOXYGEN_SHOULD_SKIP_THIS
240// include the set of methods that enable the structural constraint to
241// be standalone, i.e., that it needs not be included into a
242// StructuralConstraintSetStatic to be used by learning algorithms
243# define GUM_CONSTRAINT_CLASS_NAME StructuralConstraintPossibleEdges
245# undef GUM_CONSTRAINT_CLASS_NAME
246#endif // DOXYGEN_SHOULD_SKIP_THIS
247
248 protected:
251 };
252
253 } /* namespace learning */
254
255} /* namespace gum */
256
258#ifndef GUM_NO_INLINE
260#endif /* GUM_NO_INLINE */
261
262#endif /* GUM_LEARNING_STRUCTURAL_CONSTRAINT_POSSIBLE_EDGES_H */
Base class for all oriented graphs.
Definition diGraph.h:132
The base class for all undirected edges.
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...
bool checkModificationAlone(const ArcReversal &change) const
checks whether the constraints enable to reverse an arc
void modifyGraphAlone(const ArcDeletion &change)
notify the constraint of a modification of the graph
void modifyGraphAlone(const GraphChange &change)
notify the constraint of a modification of the graph
bool checkArcReversalAlone(NodeId x, NodeId y) const
checks whether the constraints enable to reverse arc (x,y)
bool isAlwaysInvalidAlone(const GraphChange &change) const
indicates whether a change will always violate the constraint
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
bool checkModificationAlone(const GraphChange &change) const
checks whether the constraints enable to perform a graph change
bool checkModificationAlone(const ArcAddition &change) const
checks whether the constraints enable to add an arc
EdgeSet _PossibleEdges_possible_edges_
the PossibleEdges on which we perform checks
void addEdge(const Edge &edge)
assign a new forbidden arc
void setGraphAlone(const DiGraph &graph)
sets a new graph from which we will perform checkings
bool checkArcTriangleDeletion2Alone(NodeId node1, NodeId node2, NodeId node3) const
checks whether the constraints enable to apply an ArcTriangleDeletion2
StructuralConstraintPossibleEdges & operator=(const StructuralConstraintPossibleEdges &from)
copy operator
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 ArcTriangleDeletion1 &change) const
checks whether the constraints enable to apply an ArcTriangleDeletion1
void setEdges(const EdgeSet &set)
assign a set of forbidden arcs
const EdgeSet & edges() 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 ArcTriangleDeletion2 &change)
notify the constraint of a modification of the graph
void modifyGraphAlone(const ArcReversal &change)
notify the constraint of a modification of the graph
void eraseEdge(const Edge &edge)
remove a forbidden arc
bool checkArcDeletionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to remove arc (x,y)
void modifyGraphAlone(const ArcAddition &change)
notify the constraint of a modification of the graph
Set< Edge > EdgeSet
Some typdefs and define for shortcuts ...
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 structural constraint for forbidding the creation of some arcs during structure learning
the base class for all structural constraints