aGrUM 3.1.1
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-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
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
64
65#define GUM_STRUCTURAL_CONSTRAINT_TABU_LIST_DEFAULT_SIZE 2
66
67namespace gum {
68
69 namespace learning {
70
85 public:
86 // ##########################################################################
88 // ##########################################################################
90
93
96
99
102
105
107
108 // ##########################################################################
110 // ##########################################################################
112
115
118
120
121 // ##########################################################################
123 // ##########################################################################
125
127 void setTabuListSize(Size new_size);
128
131
133
137 void modifyGraphAlone(const ArcAddition& change);
138
140
142 void modifyGraphAlone(const ArcDeletion& change);
143
145
149 void modifyGraphAlone(const ArcReversal& change);
150
152
156
158
162
164
168 void modifyGraphAlone(const GraphChange& change);
169
171
184 bool isAlwaysInvalidAlone(const GraphChange& change) const;
185
187
190
192
194
196
199
201
204 bool checkArcTriangleDeletion1Alone(NodeId node1, NodeId node2, NodeId node3) const;
205
207
210 bool checkArcTriangleDeletion2Alone(NodeId node1, NodeId node2, NodeId node3) const;
211
213
218 bool checkModificationAlone(const GraphChange& change) const;
219
221
223 bool checkModificationAlone(const ArcAddition& change) const;
224
226
227 bool checkModificationAlone(const ArcDeletion& change) const;
228
230
232 bool checkModificationAlone(const ArcReversal& change) const;
233
235
239
241
245
247
248#ifndef DOXYGEN_SHOULD_SKIP_THIS
249// include the set of methods that enable the structural constraint to
250// be standalone, i.e., that it needs not be included into a
251// StructuralConstraintSetStatic to be used by learning algorithms
252# define GUM_CONSTRAINT_CLASS_NAME StructuralConstraintTabuList
254# undef GUM_CONSTRAINT_CLASS_NAME
255#endif // DOXYGEN_SHOULD_SKIP_THIS
256
257 protected:
264 using GraphHash = std::pair< Size, Size >;
265
268
271
274
277
278 GraphHash _hashArc_(NodeId node1, NodeId node2) const;
279
280 GraphHash _xorHashes_(const GraphHash& hash1, const GraphHash& hash2) const;
281
283 };
284
285 } /* namespace learning */
286
287} /* namespace gum */
288
290#ifndef GUM_NO_INLINE
292#endif /* GUM_NO_INLINE */
293
294#endif /* GUM_LEARNING_STRUCTURAL_TABU_LIST_H */
Base class for all oriented graphs.
Definition diGraph.h:132
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.
The graph change substituting a triangle node1->node2->node3 + node1->node3 into v-structure node2->n...
The graph change substituting a triangle node1->node2->node3 + node1->node3 into v-structure node1->n...
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 checkArcTriangleDeletion1Alone(NodeId node1, NodeId node2, NodeId node3) const
checks whether the constraints enable to apply an ArcTriangleDeletion1
bool checkArcDeletionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to remove arc (x,y)
Size _tabuList_offset_
the index of the oldest element
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 checkModificationAlone(const ArcTriangleDeletion1 &change) 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
Bijection< GraphHash, Size > _graph_tabuList_
the tabu list
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 ArcDeletion &change)
notify the constraint of a modification of the graph
StructuralConstraintTabuList & operator=(const StructuralConstraintTabuList &from)
copy operator
bool checkModificationAlone(const ArcTriangleDeletion2 &change) const
checks whether the constraints enable to apply an ArcTriangleDeletion2
std::pair< Size, Size > GraphHash
The representation of a graph: a graph is defined by its set of arcs.
bool checkArcTriangleDeletion2Alone(NodeId node1, NodeId node2, NodeId node3) const
checks whether the constraints enable to apply an ArcTriangleDeletion2
GraphHash _xorHashes_(const GraphHash &hash1, const GraphHash &hash2) const
GraphHash _hashArc_(NodeId node1, NodeId node2) const
bool checkModificationAlone(const ArcAddition &change) const
checks whether the constraints enable to add an arc
void modifyGraphAlone(const ArcTriangleDeletion1 &change)
notify the constraint of a modification of the graph
GraphHash _xorWithCurrentGraph_(const GraphHash &hash) const
void modifyGraphAlone(const ArcTriangleDeletion2 &change)
notify the constraint of a modification of the graph
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