29 #ifndef GUM_LEARNING_IGRAPH_CHANGES_GENERATOR_4_UNDIGRAPH_H 30 #define 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.
The class for notifying learning algorithms of edge removalsThis class is convenient to know at compi...
The class for notifying learning algorithms of new edge additionsThis class is convenient to know at ...
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.
Base class for undirected graphs.
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