aGrUM 3.1.1
a C++ library for (probabilistic) graphical models
structuralConstraintNoChildrenNodes_inl.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#pragma once
42
43
45
52#ifndef DOXYGEN_SHOULD_SKIP_THIS
53
54namespace gum {
55
56 namespace learning {
57
59 INLINE void StructuralConstraintNoChildrenNodes::setGraphAlone(const DiGraph& graph) {}
60
63 NodeId y) const {
64 return !_noChildrenNodes_.exists(x);
65 }
66
69 NodeId y) const {
70 return true;
71 }
72
75 NodeId y) const {
76 return !_noChildrenNodes_.exists(y);
77 }
78
80 INLINE bool
82 NodeId y,
83 NodeId z) const {
84 // no need to check whether y cannot have children since, in the triangleDeletion1 case,
85 // we know that, before performing the deletion, z is a child of y
86 return !_noChildrenNodes_.exists(z);
87 }
88
90 INLINE bool
92 NodeId y,
93 NodeId z) const {
94 // no need to check whether x cannot have children since, in the triangleDeletion1 case,
95 // we know that, before performing the deletion, y is a child of x
96 return !_noChildrenNodes_.exists(z);
97 }
98
101 const ArcAddition& change) const {
102 return checkArcAdditionAlone(change.node1(), change.node2());
103 }
104
107 const ArcDeletion& change) const {
108 return checkArcDeletionAlone(change.node1(), change.node2());
109 }
110
113 const ArcReversal& change) const {
114 return checkArcReversalAlone(change.node1(), change.node2());
115 }
116
119 const ArcTriangleDeletion1& change) const {
120 return checkArcTriangleDeletion1Alone(change.node1(), change.node2(), change.node3());
121 }
122
125 const ArcTriangleDeletion2& change) const {
126 return checkArcTriangleDeletion2Alone(change.node1(), change.node2(), change.node3());
127 }
128
130
133
136
139
141 INLINE void
143
145 INLINE void
147
150
152
155 _noChildrenNodes_ = set;
156 }
157
160 _noChildrenNodes_.insert(node);
161 }
162
165 _noChildrenNodes_.erase(node);
166 }
167
170 return _noChildrenNodes_;
171 }
172
173// include all the methods applicable to the whole class hierarchy
174# define GUM_CONSTRAINT_CLASS_NAME StructuralConstraintNoChildrenNodes
176# undef GUM_CONSTRAINT_CLASS_NAME
177
178 } /* namespace learning */
179
180} /* namespace gum */
181
182#endif /* DOXYGEN_SHOULD_SKIP_THIS */
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 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
bool checkArcTriangleDeletion1Alone(NodeId node1, NodeId node2, NodeId node3) const
checks whether the constraints enable to apply an ArcTriangleDeletion1
bool checkArcAdditionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to add arc (x,y)
const NodeSet & nodes() const
returns the set of w nodes without children
bool checkModificationAlone(const GraphChange &change) const
checks whether the constraints enable to perform a graph change
void setNodes(const NodeSet &set)
assign a set of nodes without children
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
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
gum is the global namespace for all aGrUM entities
Definition agrum.h:46
the structural constraint for forbidding children for some nodes during structure learning