aGrUM 2.3.2
a C++ library for (probabilistic) graphical models
structuralConstraintTabuList.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
56#ifndef GUM_LEARNING_STRUCTURAL_CONSTRAINT_TABU_LIST_H
57#define GUM_LEARNING_STRUCTURAL_CONSTRAINT_TABU_LIST_H
58
59#include <limits>
60
61#include <agrum/agrum.h>
62
65
66#define GUM_STRUCTURAL_CONSTRAINT_TABU_LIST_DEFAULT_SIZE 2
67
68namespace gum {
69
70 namespace learning {
71
86 public:
87 // ##########################################################################
89 // ##########################################################################
91
94
97
100
103
106
108
109 // ##########################################################################
111 // ##########################################################################
113
116
119
121
122 // ##########################################################################
124 // ##########################################################################
126
128 void setTabuListSize(Size new_size);
129
131 void setGraphAlone(const DiGraph& graph);
132
134
138 void modifyGraphAlone(const ArcAddition& change);
139
141
143 void modifyGraphAlone(const ArcDeletion& change);
144
146
150 void modifyGraphAlone(const ArcReversal& change);
151
153
157 void modifyGraphAlone(const GraphChange& change);
158
160
173 bool isAlwaysInvalidAlone(const GraphChange& change) const;
174
176
179
181
183
185
188
190
195 bool checkModificationAlone(const GraphChange& change) const;
196
198
200 bool checkModificationAlone(const ArcAddition& change) const;
201
203
204 bool checkModificationAlone(const ArcDeletion& change) const;
205
207
209 bool checkModificationAlone(const ArcReversal& change) const;
210
212
213#ifndef DOXYGEN_SHOULD_SKIP_THIS
214// include the set of methods that enable the structural constraint to
215// be standalone, i.e., that it needs not be included into a
216// StructuralConstraintSetStatic to be used by learning algorithms
217# define GUM_CONSTRAINT_CLASS_NAME StructuralConstraintTabuList
219# undef GUM_CONSTRAINT_CLASS_NAME
220#endif // DOXYGEN_SHOULD_SKIP_THIS
221
222 protected:
225
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_TABU_LIST_H */
Set of pairs of elements with fast search for both elements.
Set of pairs of elements with fast search for both elements.
Definition bijection.h:1594
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 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
void setTabuListSize(Size new_size)
sets the size of the tabu list
bool checkArcDeletionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to remove arc (x,y)
bool checkModificationAlone(const GraphChange &change) const
checks whether the constraints enable to perform a graph change
bool checkModificationAlone(const ArcDeletion &change) const
checks whether the constraints enable to remove an arc
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
NodeId _TabuList_offset_
the index of the oldest element
bool checkModificationAlone(const ArcReversal &change) const
checks whether the constraints enable to reverse an arc
void setGraphAlone(const DiGraph &graph)
sets a new graph from which we will perform checkings
bool checkArcReversalAlone(NodeId x, NodeId y) const
checks whether the constraints enable to reverse arc (x,y)
void modifyGraphAlone(const GraphChange &change)
notify the constraint of a modification of the graph
void modifyGraphAlone(const ArcDeletion &change)
notify the constraint of a modification of the graph
StructuralConstraintTabuList & operator=(const StructuralConstraintTabuList &from)
copy operator
Bijection< GraphChange, NodeId > _TabuList_changes_
the tabu list
bool checkModificationAlone(const ArcAddition &change) const
checks whether the constraints enable to add an arc
std::size_t Size
In aGrUM, hashed values are unsigned long int.
Definition types.h:74
Size NodeId
Type for node ids.
gum is the global namespace for all aGrUM entities
Definition agrum.h:46
the base class for all structural constraints
the class imposing a N-sized tabu list as a structural constraints for learning algorithms
the base class for all structural constraints