aGrUM 2.3.2
a C++ library for (probabilistic) graphical models
gum::learning::IGraphChangesGenerator4DiGraph Class Referenceabstract

#include <IGraphChangesGenerator4DiGraph.h>

Inheritance diagram for gum::learning::IGraphChangesGenerator4DiGraph:

Public Types

using iterator = typename Set< GraphChange >::const_iterator
 the iterator for parsing the list of possible graph change operators
using const_iterator = iterator
 the const iterator for parsing the list of graph change operators

Public Member Functions

Iterators
virtual iterator begin () const =0
 returns an (unsafe) iterator on the beginning of the list of operators
virtual const iteratorend () const =0
 returns an (unsafe) iterator on the end of the list of operators
Accessors / Modifiers
virtual void setGraph (const DiGraph &graph)=0
 sets a new graph from which the operator will compute possible changes
virtual void modifyGraph (const ArcAddition &change)=0
 notify the operator set of a change applied to the graph
virtual void modifyGraph (const ArcDeletion &change)=0
 notify the operator set of a change applied to the graph
virtual void modifyGraph (const ArcReversal &change)=0
 notify the operator set of a change applied to the graph
virtual void modifyGraph (const GraphChange &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 notifyGetCompleted ()=0
 notifies the generator that we have parsed all its legal changes

Detailed Description

Definition at line 59 of file IGraphChangesGenerator4DiGraph.h.

Member Typedef Documentation

◆ const_iterator

the const iterator for parsing the list of graph change operators

Definition at line 65 of file IGraphChangesGenerator4DiGraph.h.

◆ iterator

the iterator for parsing the list of possible graph change operators

Definition at line 62 of file IGraphChangesGenerator4DiGraph.h.

Member Function Documentation

◆ begin()

virtual iterator gum::learning::IGraphChangesGenerator4DiGraph::begin ( ) const
pure virtual

◆ clearChanges()

virtual void gum::learning::IGraphChangesGenerator4DiGraph::clearChanges ( )
pure virtualnoexcept

◆ end()

virtual const iterator & gum::learning::IGraphChangesGenerator4DiGraph::end ( ) const
pure virtual

◆ modifyGraph() [1/4]

virtual void gum::learning::IGraphChangesGenerator4DiGraph::modifyGraph ( const ArcAddition & change)
pure virtual

◆ modifyGraph() [2/4]

virtual void gum::learning::IGraphChangesGenerator4DiGraph::modifyGraph ( const ArcDeletion & change)
pure virtual

◆ modifyGraph() [3/4]

virtual void gum::learning::IGraphChangesGenerator4DiGraph::modifyGraph ( const ArcReversal & change)
pure virtual

◆ modifyGraph() [4/4]

virtual void gum::learning::IGraphChangesGenerator4DiGraph::modifyGraph ( const GraphChange & change)
pure virtual

◆ notifyGetCompleted()

virtual void gum::learning::IGraphChangesGenerator4DiGraph::notifyGetCompleted ( )
pure virtual

notifies the generator that we have parsed all its legal changes

Implemented in gum::learning::GraphChangesGenerator4DiGraph< STRUCT_CONSTRAINT >, gum::learning::GraphChangesGenerator4K2< STRUCT_CONSTRAINT >, and gum::learning::GraphChangesGeneratorOnSubDiGraph< STRUCT_CONSTRAINT >.

References notifyGetCompleted().

Referenced by notifyGetCompleted().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ setGraph()

virtual void gum::learning::IGraphChangesGenerator4DiGraph::setGraph ( const DiGraph & graph)
pure virtual

The documentation for this class was generated from the following file: