47#ifndef GUM_LEARNING_IGRAPH_CHANGES_GENERATOR_4_DIGRAPH_H
48#define GUM_LEARNING_IGRAPH_CHANGES_GENERATOR_4_DIGRAPH_H
Base class for all oriented graphs.
SetIterator< Key > const_iterator
Types for STL compliance.
The class for notifying learning algorithms of new arc additions.
The class for notifying learning algorithms of arc removals.
The class for notifying learning algorithms of arc reversals.
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
virtual void modifyGraph(const ArcReversal &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
virtual void setGraph(const DiGraph &graph)=0
sets a new graph from which the operator will compute possible changes
virtual void modifyGraph(const ArcDeletion &change)=0
notify the operator set of a change applied to the graph
virtual void notifyGetCompleted()=0
notifies the generator that we have parsed all its legal changes
typename Set< GraphChange >::const_iterator iterator
the iterator for parsing the list of possible graph change operators
virtual void modifyGraph(const ArcAddition &change)=0
notify the operator set of a change applied to the graph
virtual void clearChanges() noexcept=0
empty the set of possible change operators that can be applied
virtual void modifyGraph(const GraphChange &change)=0
notify the operator set of a change applied to the graph
Base classes for oriented graphs.
the classes to account for structure changes in a graph
include the inlined functions if necessary
gum is the global namespace for all aGrUM entities