aGrUM 3.1.1
a C++ library for (probabilistic) graphical models
structuralConstraintNoChildrenNodes.cpp
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
50
52#ifdef GUM_NO_INLINE
54#endif /* GUM_NO_INLINE */
55
56namespace gum::learning {
57
62
68
74
81
86
93
97 if (this != &from) { _noChildrenNodes_ = std::move(from._noChildrenNodes_); }
98 return *this;
99 }
100
101 bool
103 switch (change.type()) {
105 return checkArcAdditionAlone(change.node1(), change.node2());
106
108 return checkArcDeletionAlone(change.node1(), change.node2());
109
111 return checkArcReversalAlone(change.node1(), change.node2());
112
114 return checkArcTriangleDeletion1Alone(change.node1(), change.node2(), change.node3());
115
117 return checkArcTriangleDeletion2Alone(change.node1(), change.node2(), change.node3());
118
119 default :
121 "edge modifications are not "
122 "supported by the No-Children Nodes structural constraint");
123 }
124 }
125
127 switch (change.type()) {
128 case GraphChangeType::ARC_ADDITION : return _noChildrenNodes_.exists(change.node1());
129
130 case GraphChangeType::ARC_DELETION : return false;
131
132 case GraphChangeType::ARC_REVERSAL : return _noChildrenNodes_.exists(change.node2());
133
135 return _noChildrenNodes_.exists(change.node2()) || _noChildrenNodes_.exists(change.node3());
136
138 return _noChildrenNodes_.exists(change.node1()) || _noChildrenNodes_.exists(change.node3());
139
140 default :
142 "edge modifications are not supported "
143 "by the No-Children Nodes structural constraint");
144 }
145 }
146} // namespace gum::learning
Base class for all oriented graphs.
Definition diGraph.h:132
Exception : operation not allowed.
NodeId node1() const noexcept
returns the first node involved in the modification
GraphChangeType type() const noexcept
returns the type of the operation
NodeId node2() const noexcept
returns the second node involved in the modification
NodeId node3() const
returns the third node involved in the modification (if any)
the structural constraint for forbidding children for some nodes
bool checkArcReversalAlone(NodeId x, NodeId y) const
checks whether the constraints enable to reverse arc (x,y)
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
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
bool checkArcAdditionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to add arc (x,y)
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
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:76
include the inlined functions if necessary
Definition CSVParser.h:55
STL namespace.
the structural constraint for forbidding children for some nodes during structure learning
the structural constraint for forbidding the creation of some arcs during structure learning