aGrUM  0.16.0
IGraphChangesGenerator4UndiGraph.h
Go to the documentation of this file.
1 
29 #ifndef GUM_LEARNING_IGRAPH_CHANGES_GENERATOR_4_UNDIGRAPH_H
30 #define GUM_LEARNING_IGRAPH_CHANGES_GENERATOR_4_UNDIGRAPH_H
31 
32 #include <agrum/agrum.h>
33 #include <agrum/core/set.h>
34 #include <agrum/graphs/undiGraph.h>
36 
37 namespace gum {
38 
39  namespace learning {
40 
42  public:
45 
48 
49  // ##########################################################################
51  // ##########################################################################
53 
55  virtual iterator begin() const = 0;
56 
58  virtual const iterator& end() const = 0;
59 
61 
62  // ##########################################################################
64  // ##########################################################################
66 
68  virtual void setGraph(const UndiGraph& graph) = 0;
69 
71  virtual void modifyGraph(const EdgeAddition& change) = 0;
72 
74  virtual void modifyGraph(const EdgeDeletion& change) = 0;
75 
77  virtual void modifyGraph(const GraphChange& change) = 0;
78 
80  virtual void clearChanges() noexcept = 0;
81 
83  virtual void notifyGetCompleted() = 0;
84 
86  };
87 
88  } /* namespace learning */
89 
90 } /* namespace gum */
91 
92 #endif /* GUM_LEARNING_IGRAPH_CHANGES_GENERATOR_4_UNDIGRAPH_H */
virtual void setGraph(const UndiGraph &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.
virtual void notifyGetCompleted()=0
notifies the generator that we have parsed all its legal changes
virtual void clearChanges() noexcept=0
empty the set of possible change operators that can be applied
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.
Definition: agrum.h:25
The class for notifying learning algorithms of edge removalsThis class is convenient to know at compi...
Definition: graphChange.h:414
The class for notifying learning algorithms of new edge additionsThis class is convenient to know at ...
Definition: graphChange.h:348
virtual void modifyGraph(const EdgeAddition &change)=0
notify the operator set of a change applied to the graph
iterator const_iterator
the const iterator for parsing the list of graph change operators
typename Set< GraphChange >::const_iterator iterator
the iterator for parsing the list of possible graph change operators
Unsafe iterators for the Set class.
Definition: set.h:1025
Base class for undirected graphs.
Definition: undiGraph.h:109
virtual iterator begin() const =0
returns an (unsafe) iterator on the beginning of the list of operators
virtual const iterator & end() const =0
returns an (unsafe) iterator on the end of the list of operators