aGrUM 2.3.2
a C++ library for (probabilistic) graphical models
graphChangesGenerator4DiGraph.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
80#ifndef GUM_LEARNING_GRAPH_CHANGES_GENERATOR_4_DIGRAPH_H
81#define GUM_LEARNING_GRAPH_CHANGES_GENERATOR_4_DIGRAPH_H
82
83#include <agrum/agrum.h>
84
88
89namespace gum {
90
91 namespace learning {
92
134 template < typename STRUCT_CONSTRAINT >
136 public:
139
142
143 // ##########################################################################
145 // ##########################################################################
147
150
153
156
159
161
162 // ##########################################################################
164 // ##########################################################################
166
170
174
176
177 // ##########################################################################
179 // ##########################################################################
181
184
186 const iterator& end() const;
187
189
190 // ##########################################################################
192 // ##########################################################################
194
196 STRUCT_CONSTRAINT& constraint() const noexcept;
197
200 void setGraph(const DiGraph& graph);
201
203 void modifyGraph(const ArcAddition& change);
204
206 void modifyGraph(const ArcDeletion& change);
207
209 void modifyGraph(const ArcReversal& change);
210
212 void modifyGraph(const GraphChange& change);
213
215 void clearChanges() noexcept;
216
219
221 void setMaxNbThreads(Size nb) noexcept;
222
224
225 protected:
228
230 STRUCT_CONSTRAINT* constraint_;
231
234
237
238 private:
241 };
242
243 } /* namespace learning */
244
245} /* namespace gum */
246
249
250#endif /* GUM_LEARNING_GRAPH_CHANGES_GENERATOR_4_DIGRAPH_H */
The base class for all GraphChangesGenerators for directed structures.
Base class for all oriented graphs.
Definition diGraph.h:130
Representation of a set.
Definition set.h:131
SetIterator< Key > const_iterator
Types for STL compliance.
Definition set.h:143
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 setMaxNbThreads(Size nb) noexcept
sets the maximum number of threads used to compute the set of changes
STRUCT_CONSTRAINT & constraint() const noexcept
returns the constraint that is used by the generator
GraphChangesGenerator4DiGraph(const GraphChangesGenerator4DiGraph< STRUCT_CONSTRAINT > &from)
copy constructor
GraphChangesGenerator4DiGraph< STRUCT_CONSTRAINT > & operator=(GraphChangesGenerator4DiGraph< STRUCT_CONSTRAINT > &&from)
move operator
void clearChanges() noexcept
empty the set of possible change operators that can be applied
Size _max_threads_number_
the max number of threads authorized
typename Set< GraphChange >::const_iterator iterator
the iterator for parsing the list of possible graph change operators
iterator begin() const
returns an (unsafe) iterator on the beginning of the list of operators
GraphChangesGenerator4DiGraph(GraphChangesGenerator4DiGraph< STRUCT_CONSTRAINT > &&from)
move operator
DiGraph graph_
the graph on which we generate operators
iterator const_iterator
the const iterator for parsing the list of graph change operators
void createChanges_()
create the set of legal and illegal changes from a given graph
void modifyGraph(const ArcAddition &change)
notify the generator of a change applied to the graph
GraphChangesGenerator4DiGraph< STRUCT_CONSTRAINT > & operator=(const GraphChangesGenerator4DiGraph< STRUCT_CONSTRAINT > &from)
copy operator
const iterator & end() const
returns an (unsafe) iterator on the end of the list of operators
STRUCT_CONSTRAINT * constraint_
the structural constraint used to restrict the changes
void setGraph(const DiGraph &graph)
sets a new graph from which the generator will compute possible changes
void notifyGetCompleted()
notifies the generator that we have parsed all its legal changes
GraphChangesGenerator4DiGraph(STRUCT_CONSTRAINT &constraint)
default constructor
Set< GraphChange > legal_changes_
the current set of graph changes
The basic class for computing the next graph changes possible in a (directed) structure learning algo...
std::size_t Size
In aGrUM, hashed values are unsigned long int.
Definition types.h:74
include the inlined functions if necessary
Definition CSVParser.h:54
gum is the global namespace for all aGrUM entities
Definition agrum.h:46
unsigned int getNumberOfThreads()
returns the max number of threads used by default when entering the next parallel region
The class to use to execute a function by several threads.
Utility functions used for exploiting OpenMP/STL parallelism.