aGrUM 3.2.0
a C++ library for (probabilistic) graphical models
structuralConstraintNoChildrenNodes.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_NO_CHILDREN_NODES_H
49#define GUM_LEARNING_STRUCTURAL_CONSTRAINT_NO_CHILDREN_NODES_H
50
51#include <agrum/agrum.h>
52
54
55namespace gum::learning {
56
62 public virtual StructuralConstraintEmpty {
63 public:
64 // ##########################################################################
66 // ##########################################################################
68
71
74
77
80
83
85
86 // ##########################################################################
88 // ##########################################################################
90
93
96
98
99 // ##########################################################################
101 // ##########################################################################
103
105 void setNodes(const NodeSet& set);
106
108 void addNode(NodeId node);
109
111 void eraseNode(NodeId node);
112
114 const NodeSet& nodes() const;
115
118
120 void modifyGraphAlone(const ArcAddition& change);
121
123 void modifyGraphAlone(const ArcDeletion& change);
124
126 void modifyGraphAlone(const ArcReversal& change);
127
129
133
135
139
141 void modifyGraphAlone(const GraphChange& change);
142
144
157 bool isAlwaysInvalidAlone(const GraphChange& change) const;
158
161
164
167
169
172 bool checkArcTriangleDeletion1Alone(NodeId node1, NodeId node2, NodeId node3) const;
173
175
178 bool checkArcTriangleDeletion2Alone(NodeId node1, NodeId node2, NodeId node3) const;
179
181 bool checkModificationAlone(const GraphChange& change) const;
182
184 bool checkModificationAlone(const ArcAddition& change) const;
185
187 bool checkModificationAlone(const ArcDeletion& change) const;
188
190 bool checkModificationAlone(const ArcReversal& change) const;
191
193
197
199
203
205
206#ifndef DOXYGEN_SHOULD_SKIP_THIS
207// include the set of methods that enable the structural constraint to
208// be standalone, i.e., that it needs not be included into a
209// StructuralConstraintSetStatic to be used by learning algorithms
210# define GUM_CONSTRAINT_CLASS_NAME StructuralConstraintNoChildrenNodes
212# undef GUM_CONSTRAINT_CLASS_NAME
213#endif // DOXYGEN_SHOULD_SKIP_THIS
214
215 protected:
218 };
219
220} // namespace gum::learning
221
223#ifndef GUM_NO_INLINE
225#endif /* GUM_NO_INLINE */
226
227#endif /* GUM_LEARNING_STRUCTURAL_CONSTRAINT_NO_CHILDREN_NODES_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...
bool checkModificationAlone(const ArcAddition &change) const
checks whether the constraints enable to add an arc
bool checkArcReversalAlone(NodeId x, NodeId y) const
checks whether the constraints enable to reverse arc (x,y)
void addNode(NodeId node)
assign a new node without children
bool checkArcTriangleDeletion2Alone(NodeId node1, NodeId node2, NodeId node3) const
checks whether the constraints enable to apply an ArcTriangleDeletion2
NodeSet _noChildrenNodes_
the set of w nodes without children on which we perform checks
void setGraphAlone(const DiGraph &graph)
sets a new graph from which we will perform checkings
StructuralConstraintNoChildrenNodes & operator=(const StructuralConstraintNoChildrenNodes &from)
copy operator
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
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
bool checkModificationAlone(const ArcDeletion &change) const
checks whether the constraints enable to remove an arc
bool checkArcAdditionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to add arc (x,y)
bool checkModificationAlone(const ArcTriangleDeletion1 &change) const
checks whether the constraints enable to apply an ArcTriangleDeletion1
const NodeSet & nodes() const
returns the set of w nodes without children
bool checkModificationAlone(const ArcTriangleDeletion2 &change) const
checks whether the constraints enable to apply an ArcTriangleDeletion2
bool isAlwaysInvalidAlone(const GraphChange &change) const
indicates whether a change will always violate the constraint
bool checkModificationAlone(const GraphChange &change) const
checks whether the constraints enable to perform a graph change
void modifyGraphAlone(const ArcTriangleDeletion1 &change)
notify the constraint of a modification of the graph
void setNodes(const NodeSet &set)
assign a set of nodes without children
void modifyGraphAlone(const GraphChange &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 eraseNode(NodeId node)
remove a forbidden w node without children
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)
Size NodeId
Type for node ids.
Set< NodeId > NodeSet
Some typdefs and define for shortcuts ...
include the inlined functions if necessary
Definition CSVParser.h:55
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