aGrUM 2.3.2
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-2025 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-2025 *
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#pragma once
41
42
44
51#ifndef DOXYGEN_SHOULD_SKIP_THIS
52
53namespace gum {
54
55 namespace learning {
56
58 INLINE void StructuralConstraintNoChildrenNodes::setGraphAlone(const DiGraph& graph) {}
59
62 NodeId y) const {
63 return !_noChildrenNodes_.exists(x);
64 }
65
68 NodeId y) const {
69 return true;
70 }
71
74 NodeId y) const {
75 return !_noChildrenNodes_.exists(y);
76 }
77
80 const ArcAddition& change) const {
81 return checkArcAdditionAlone(change.node1(), change.node2());
82 }
83
86 const ArcDeletion& change) const {
87 return checkArcDeletionAlone(change.node1(), change.node2());
88 }
89
92 const ArcReversal& change) const {
93 return checkArcReversalAlone(change.node1(), change.node2());
94 }
95
98 const GraphChange& change) const {
99 switch (change.type()) {
101 return checkArcAdditionAlone(change.node1(), change.node2());
102
104 return checkArcDeletionAlone(change.node1(), change.node2());
105
107 return checkArcReversalAlone(change.node1(), change.node2());
108
109 default :
110 GUM_ERROR(OperationNotAllowed,
111 "edge modifications are not "
112 "supported by StructuralConstraintNoChildrenNodes");
113 }
114 }
115
118
121
124
127
129 INLINE bool
131 switch (change.type()) {
133 return !checkArcAdditionAlone(change.node1(), change.node2());
134
136 return checkArcDeletionAlone(change.node1(), change.node2());
137
139 return !checkArcAdditionAlone(change.node2(), change.node1());
140
141 default :
142 GUM_ERROR(OperationNotAllowed,
143 "edge modifications are not supported "
144 "by StructuralConstraintNoChildrenNodes");
145 }
146 }
147
150 _noChildrenNodes_ = set;
151 }
152
155 _noChildrenNodes_.insert(node);
156 }
157
160 _noChildrenNodes_.erase(node);
161 }
162
165 return _noChildrenNodes_;
166 }
167
168// include all the methods applicable to the whole class hierarchy
169# define GUM_CONSTRAINT_CLASS_NAME StructuralConstraintNoChildrenNodes
171# undef GUM_CONSTRAINT_CLASS_NAME
172
173 } /* namespace learning */
174
175} /* namespace gum */
176
177#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.
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
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 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 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 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)
#define GUM_ERROR(type, msg)
Definition exceptions.h:72
Size NodeId
Type for node ids.
Set< NodeId > NodeSet
Some typdefs and define for shortcuts ...
include the inlined functions if necessary
Definition CSVParser.h:54
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