aGrUM
3.2.0
a C++ library for (probabilistic) graphical models
Toggle main menu visibility
IGraphChangesGenerator4UndiGraph.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
48
#ifndef GUM_LEARNING_IGRAPH_CHANGES_GENERATOR_4_UNDIGRAPH_H
49
#define GUM_LEARNING_IGRAPH_CHANGES_GENERATOR_4_UNDIGRAPH_H
50
51
#include <
agrum/agrum.h
>
52
53
#include <
agrum/base/graphs/undiGraph.h
>
54
#include <
agrum/BN/learning/structureUtils/graphChange.h
>
55
56
namespace
gum
{
57
58
namespace
learning
{
59
60
class
GUM_PUBLIC_BN
IGraphChangesGenerator4UndiGraph
{
61
public
:
63
using
iterator
=
typename
Set< GraphChange >::const_iterator
;
64
66
using
const_iterator
=
iterator
;
67
68
// ##########################################################################
70
// ##########################################################################
72
74
virtual
iterator
begin
()
const
= 0;
75
77
virtual
const
iterator
&
end
()
const
= 0;
78
80
81
// ##########################################################################
83
// ##########################################################################
85
87
virtual
void
setGraph
(
const
UndiGraph
&
graph
) = 0;
88
90
virtual
void
modifyGraph
(
const
EdgeAddition
& change) = 0;
91
93
virtual
void
modifyGraph
(
const
EdgeDeletion
& change) = 0;
94
96
virtual
void
modifyGraph
(
const
GraphChange
& change) = 0;
97
99
virtual
void
clearChanges
() noexcept = 0;
100
102
virtual
void
notifyGetCompleted
() = 0;
103
105
};
106
107
}
/* namespace learning */
108
109
}
/* namespace gum */
110
111
#endif
/* GUM_LEARNING_IGRAPH_CHANGES_GENERATOR_4_UNDIGRAPH_H */
agrum.h
gum::Set::const_iterator
SetIterator< Key > const_iterator
Types for STL compliance.
Definition
set.h:141
gum::UndiGraph
Base class for undirected graphs.
Definition
undiGraph.h:130
gum::learning::EdgeAddition
The class for notifying learning algorithms of new edge additions.
Definition
graphChange.h:518
gum::learning::EdgeDeletion
The class for notifying learning algorithms of edge removals.
Definition
graphChange.h:571
gum::learning::GraphChange
Definition
graphChange.h:101
gum::learning::IGraphChangesGenerator4UndiGraph
Definition
IGraphChangesGenerator4UndiGraph.h:60
gum::learning::IGraphChangesGenerator4UndiGraph::modifyGraph
virtual void modifyGraph(const EdgeDeletion &change)=0
notify the operator set of a change applied to the graph
gum::learning::IGraphChangesGenerator4UndiGraph::const_iterator
iterator const_iterator
the const iterator for parsing the list of graph change operators
Definition
IGraphChangesGenerator4UndiGraph.h:66
gum::learning::IGraphChangesGenerator4UndiGraph::end
virtual const iterator & end() const =0
returns an (unsafe) iterator on the end of the list of operators
gum::learning::IGraphChangesGenerator4UndiGraph::iterator
typename Set< GraphChange >::const_iterator iterator
the iterator for parsing the list of possible graph change operators
Definition
IGraphChangesGenerator4UndiGraph.h:63
gum::learning::IGraphChangesGenerator4UndiGraph::begin
virtual iterator begin() const =0
returns an (unsafe) iterator on the beginning of the list of operators
gum::learning::IGraphChangesGenerator4UndiGraph::clearChanges
virtual void clearChanges() noexcept=0
empty the set of possible change operators that can be applied
gum::learning::IGraphChangesGenerator4UndiGraph::setGraph
virtual void setGraph(const UndiGraph &graph)=0
sets a new graph from which the operator will compute possible changes
gum::learning::IGraphChangesGenerator4UndiGraph::modifyGraph
virtual void modifyGraph(const EdgeAddition &change)=0
notify the operator set of a change applied to the graph
gum::learning::IGraphChangesGenerator4UndiGraph::modifyGraph
virtual void modifyGraph(const GraphChange &change)=0
notify the operator set of a change applied to the graph
gum::learning::IGraphChangesGenerator4UndiGraph::notifyGetCompleted
virtual void notifyGetCompleted()=0
notifies the generator that we have parsed all its legal changes
graphChange.h
the classes to account for structure changes in a graph
gum::graph
Definition
bayesBall.h:79
gum::learning
include the inlined functions if necessary
Definition
CSVParser.h:55
gum
gum is the global namespace for all aGrUM entities
Definition
agrum.h:46
undiGraph.h
Base classes for undirected graphs.
aGrUM
3.2.0
© PHW&CG&others - 2022
DoXyGeN 1.18.0