aGrUM  0.13.2
gum::learning::IGraphChangesGenerator4UndiGraph Class Referenceabstract

#include <IGraphChangesGenerator4UndiGraph.h>

+ Inheritance diagram for gum::learning::IGraphChangesGenerator4UndiGraph:

Public Member Functions

Iterators
virtual iterator begin () const =0
 returns an (unsafe) iterator on the beginning of the list of operators More...
 
virtual const iteratorend () const =0
 returns an (unsafe) iterator on the end of the list of operators More...
 
Accessors / Modifiers
virtual void setGraph (const UndiGraph &graph)=0
 sets a new graph from which the operator will compute possible changes More...
 
virtual void modifyGraph (const EdgeAddition &change)=0
 notify the operator set of a change applied to the graph More...
 
virtual void modifyGraph (const EdgeDeletion &change)=0
 notify the operator set of a change applied to the graph More...
 
virtual void modifyGraph (const GraphChange &change)=0
 notify the operator set of a change applied to the graph More...
 
virtual void clearChanges () noexcept=0
 empty the set of possible change operators that can be applied More...
 
virtual void notifyGetCompleted ()=0
 notifies the generator that we have parsed all its legal changes More...
 

Public Types

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

Detailed Description

Definition at line 38 of file IGraphChangesGenerator4UndiGraph.h.

Member Typedef Documentation

the const iterator for parsing the list of graph change operators

Definition at line 44 of file IGraphChangesGenerator4UndiGraph.h.

the iterator for parsing the list of possible graph change operators

Definition at line 41 of file IGraphChangesGenerator4UndiGraph.h.

Member Function Documentation

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

returns an (unsafe) iterator on the beginning of the list of operators

Implemented in gum::learning::GraphChangesGenerator4UndiGraph< STRUCT_CONSTRAINT >.

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

empty the set of possible change operators that can be applied

Implemented in gum::learning::GraphChangesGenerator4UndiGraph< STRUCT_CONSTRAINT >.

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

returns an (unsafe) iterator on the end of the list of operators

Implemented in gum::learning::GraphChangesGenerator4UndiGraph< STRUCT_CONSTRAINT >.

virtual void gum::learning::IGraphChangesGenerator4UndiGraph::modifyGraph ( const EdgeAddition change)
pure virtual

notify the operator set of a change applied to the graph

Implemented in gum::learning::GraphChangesGenerator4UndiGraph< STRUCT_CONSTRAINT >.

virtual void gum::learning::IGraphChangesGenerator4UndiGraph::modifyGraph ( const EdgeDeletion change)
pure virtual

notify the operator set of a change applied to the graph

Implemented in gum::learning::GraphChangesGenerator4UndiGraph< STRUCT_CONSTRAINT >.

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

notify the operator set of a change applied to the graph

Implemented in gum::learning::GraphChangesGenerator4UndiGraph< STRUCT_CONSTRAINT >.

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

notifies the generator that we have parsed all its legal changes

Implemented in gum::learning::GraphChangesGenerator4UndiGraph< STRUCT_CONSTRAINT >.

virtual void gum::learning::IGraphChangesGenerator4UndiGraph::setGraph ( const UndiGraph graph)
pure virtual

sets a new graph from which the operator will compute possible changes

Implemented in gum::learning::GraphChangesGenerator4UndiGraph< STRUCT_CONSTRAINT >.


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