aGrUM 2.3.2
a C++ library for (probabilistic) graphical models
structuralConstraintNoParentNodes.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
41
48#ifndef GUM_LEARNING_STRUCTURAL_CONSTRAINT_NO_PARENT_NODES_H
49#define GUM_LEARNING_STRUCTURAL_CONSTRAINT_NO_PARENT_NODES_H
50
51#include <agrum/agrum.h>
52
54
55namespace gum::learning {
56
62 public:
63 // ##########################################################################
65 // ##########################################################################
67
70
73
76
79
82
84
85 // ##########################################################################
87 // ##########################################################################
89
92
95
97
98 // ##########################################################################
100 // ##########################################################################
102
104 void setNodes(const NodeSet& set);
105
107 void addNode(NodeId node);
108
110 void eraseNode(NodeId node);
111
113 const NodeSet& nodes() const;
114
116 void setGraphAlone(const DiGraph& graph);
117
119 void modifyGraphAlone(const ArcAddition& change);
120
122 void modifyGraphAlone(const ArcDeletion& change);
123
125 void modifyGraphAlone(const ArcReversal& change);
126
128 void modifyGraphAlone(const GraphChange& change);
129
131
144 bool isAlwaysInvalidAlone(const GraphChange& change) const;
145
148
151
154
156 bool checkModificationAlone(const GraphChange& change) const;
157
159 bool checkModificationAlone(const ArcAddition& change) const;
160
162 bool checkModificationAlone(const ArcDeletion& change) const;
163
165 bool checkModificationAlone(const ArcReversal& change) const;
166
168
169#ifndef DOXYGEN_SHOULD_SKIP_THIS
170// include the set of methods that enable the structural constraint to
171// be standalone, i.e., that it needs not be included into a
172// StructuralConstraintSetStatic to be used by learning algorithms
173# define GUM_CONSTRAINT_CLASS_NAME StructuralConstraintNoParentNodes
175# undef GUM_CONSTRAINT_CLASS_NAME
176#endif // DOXYGEN_SHOULD_SKIP_THIS
177
178 protected:
181 };
182
183} // namespace gum::learning
184
186#ifndef GUM_NO_INLINE
188#endif /* GUM_NO_INLINE */
189
190#endif /* GUM_LEARNING_STRUCTURAL_CONSTRAINT_NO_PARENT_NODES_H */
Base class for all oriented graphs.
Definition diGraph.h:130
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.
NodeSet _noParentNodes_
the ForbiddenArcs on which we perform checks
bool checkArcDeletionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to remove arc (x,y)
StructuralConstraintNoParentNodes & operator=(const StructuralConstraintNoParentNodes &from)
copy operator
bool checkModificationAlone(const GraphChange &change) const
checks whether the constraints enable to perform a graph change
void modifyGraphAlone(const ArcAddition &change)
notify the constraint of a modification of the graph
const NodeSet & nodes() const
returns the set of nodes without parent
void setNodes(const NodeSet &set)
assign a set of nodes without parent
void modifyGraphAlone(const ArcReversal &change)
notify the constraint of a modification of the graph
void modifyGraphAlone(const ArcDeletion &change)
notify the constraint of a modification of the graph
bool isAlwaysInvalidAlone(const GraphChange &change) const
indicates whether a change will always violate the constraint
bool checkModificationAlone(const ArcReversal &change) const
checks whether the constraints enable to reverse an arc
void addNode(NodeId node)
assign a new node without parent
void setGraphAlone(const DiGraph &graph)
sets a new graph from which we will perform checkings
bool checkModificationAlone(const ArcAddition &change) const
checks whether the constraints enable to add an arc
bool checkModificationAlone(const ArcDeletion &change) const
checks whether the constraints enable to remove an arc
bool checkArcReversalAlone(NodeId x, NodeId y) const
checks whether the constraints enable to reverse arc (x,y)
void eraseNode(NodeId node)
remove a node without parent
bool checkArcAdditionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to add arc (x,y)
void modifyGraphAlone(const GraphChange &change)
notify the constraint of a modification of the graph
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
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