28 #ifndef GUM_LEARNING_IGRAPH_CHANGES_GENERATOR_4_DIGRAPH_H 29 #define 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...
The class for notifying learning algorithms of arc removalsThis class is convenient to know at compil...
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
iterator const_iterator
the const iterator for parsing the list of graph change operators
Base class for all oriented graphs.
virtual iterator begin() const =0
returns an (unsafe) iterator on the beginning of the list of operators
Unsafe iterators for the Set class.
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...
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