aGrUM 2.3.2
a C++ library for (probabilistic) graphical models
structuralConstraintDAG.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
47#ifndef GUM_LEARNING_STRUCTURAL_CONSTRAINT_DAG_H
48#define GUM_LEARNING_STRUCTURAL_CONSTRAINT_DAG_H
49
50#include <agrum/agrum.h>
51
54
55namespace gum {
56
57 namespace learning {
58
69 public virtual StructuralConstraintSetStatic< StructuralConstraintDiGraph > {
70 public:
71 // ##########################################################################
73 // ##########################################################################
75
78
81
83 StructuralConstraintDAG(const DAG& graph);
84
87
90
93
95
96 // ##########################################################################
98 // ##########################################################################
100
103
106
108
109 // ##########################################################################
111 // ##########################################################################
113
115 void setGraphAlone(const DiGraph& graph);
116
118 void setGraphAlone(Size nb_nodes);
119
121
128 void modifyGraphAlone(const ArcAddition& change);
129
131
133 void modifyGraphAlone(const ArcDeletion& change);
134
136
143 void modifyGraphAlone(const ArcReversal& change);
144
146
153 void modifyGraphAlone(const GraphChange& change);
154
156
169 bool isAlwaysInvalidAlone(const GraphChange& change) const;
170
172
176
179
181
185
187
189 bool checkModificationAlone(const ArcAddition& change) const;
190
192
193 bool checkModificationAlone(const ArcDeletion& change) const;
194
196
198 bool checkModificationAlone(const ArcReversal& change) const;
199
201
206 bool checkModificationAlone(const GraphChange& change) const;
207
209 void setGraph(const DAG& graph);
210
212 void setGraph(Size nb_nodes);
213
215
216#ifndef DOXYGEN_SHOULD_SKIP_THIS
217// include the set of methods that enable the structural constraint to
218// be standalone, i.e., that it needs not be included into a
219// StructuralConstraintSetStatic to be used by learning algorithms
220# define GUM_CONSTRAINT_CLASS_NAME StructuralConstraintDAG
222# undef GUM_CONSTRAINT_CLASS_NAME
223#endif // DOXYGEN_SHOULD_SKIP_THIS
224
225 protected:
228 };
229
230 } /* namespace learning */
231
232} /* namespace gum */
233
235#ifndef GUM_NO_INLINE
237#endif /* GUM_NO_INLINE */
238
239#endif /* GUM_LEARNING_STRUCTURAL_CONSTRAINT_DAG_H */
A class for detecting directed cycles in DAGs when trying to apply many changes to the graph.
A class for detecting directed cycles in DAGs when trying to apply many changes to the graph.
Base class for dag.
Definition DAG.h:121
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.
void modifyGraphAlone(const GraphChange &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
StructuralConstraintDAG & operator=(const StructuralConstraintDAG &from)
copy operator
bool checkModificationAlone(const ArcDeletion &change) const
checks whether the constraints enable to remove an arc
bool checkModificationAlone(const GraphChange &change) const
checks whether the constraints enable to perform a graph change
void setGraph(const DAG &graph)
sets a new graph from which we will perform checkings
void modifyGraphAlone(const ArcReversal &change)
notify the constraint of a modification of the graph
void modifyGraphAlone(const ArcAddition &change)
notify the constraint of a modification of the graph
bool checkArcAdditionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to add arc (x,y)
bool checkArcReversalAlone(NodeId x, NodeId y) const
checks whether the constraints enable to reverse arc (x,y)
bool checkModificationAlone(const ArcAddition &change) const
checks whether the constraints enable to add an arc
void setGraphAlone(const DiGraph &graph)
sets a new graph from which we will perform checkings
void setGraphAlone(Size nb_nodes)
sets a new empty graph from which we will perform checkings
DAGCycleDetector _DAG_cycle_detector_
the cycle detector used to check quickly graph modifications
void setGraph(Size nb_nodes)
sets a new empty graph from which we will perform checkings
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 checkArcDeletionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to remove arc (x,y)
std::size_t Size
In aGrUM, hashed values are unsigned long int.
Definition types.h:74
Size NodeId
Type for node ids.
include the inlined functions if necessary
Definition CSVParser.h:54
gum is the global namespace for all aGrUM entities
Definition agrum.h:46
the base class for structural constraints imposed by DAGs
the base class for structural constraints used by learning algorithms that learn a directed graph str...