aGrUM  0.16.0
IGraphChangesGenerator4DiGraph.h
Go to the documentation of this file.
1 
28 #ifndef GUM_LEARNING_IGRAPH_CHANGES_GENERATOR_4_DIGRAPH_H
29 #define GUM_LEARNING_IGRAPH_CHANGES_GENERATOR_4_DIGRAPH_H
30 
31 #include <agrum/agrum.h>
32 #include <agrum/core/set.h>
33 #include <agrum/graphs/diGraph.h>
35 
36 namespace gum {
37 
38  namespace learning {
39 
41  public:
44 
47 
48  // ##########################################################################
50  // ##########################################################################
52 
54  virtual iterator begin() const = 0;
55 
57  virtual const iterator& end() const = 0;
58 
60 
61  // ##########################################################################
63  // ##########################################################################
65 
67  virtual void setGraph(const DiGraph& graph) = 0;
68 
70  virtual void modifyGraph(const ArcAddition& change) = 0;
71 
73  virtual void modifyGraph(const ArcDeletion& change) = 0;
74 
76  virtual void modifyGraph(const ArcReversal& change) = 0;
77 
79  virtual void modifyGraph(const GraphChange& change) = 0;
80 
82  virtual void clearChanges() noexcept = 0;
83 
85  virtual void notifyGetCompleted() = 0;
86 
88  };
89 
90  } /* namespace learning */
91 
92 } /* namespace gum */
93 
94 #endif /* GUM_LEARNING_IGRAPH_CHANGES_GENERATOR_4_DIGRAPH_H */
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
virtual void setGraph(const DiGraph &graph)=0
sets a new graph from which the operator will compute possible changes
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
The class for notifying learning algorithms of new arc additionsThis class is convenient to know at c...
Definition: graphChange.h:150
The class for notifying learning algorithms of arc removalsThis class is convenient to know at compil...
Definition: graphChange.h:216
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
Definition: agrum.h:25
iterator const_iterator
the const iterator for parsing the list of graph change operators
Base class for all oriented graphs.
Definition: diGraph.h:111
virtual iterator begin() const =0
returns an (unsafe) iterator on the beginning of the list of operators
Unsafe iterators for the Set class.
Definition: set.h:1025
virtual const iterator & end() const =0
returns an (unsafe) iterator on the end of the list of operators
typename Set< GraphChange >::const_iterator iterator
the iterator for parsing the list of possible graph change operators
The class for notifying learning algorithms of arc reversalsThis class is convenient to know at compi...
Definition: graphChange.h:282
virtual void clearChanges() noexcept=0
empty the set of possible change operators that can be applied
virtual void notifyGetCompleted()=0
notifies the generator that we have parsed all its legal changes
virtual void modifyGraph(const ArcAddition &change)=0
notify the operator set of a change applied to the graph