![]() |
aGrUM
0.20.3
a C++ library for (probabilistic) graphical models
|
#include <IGraphChangesGenerator4UndiGraph.h>
Public Member Functions | |
Iterators | |
virtual iterator | begin () const =0 |
returns an (unsafe) iterator on the beginning of the list of operators More... | |
virtual const iterator & | end () 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... | |
Definition at line 40 of file IGraphChangesGenerator4UndiGraph.h.
the const iterator for parsing the list of graph change operators
Definition at line 46 of file IGraphChangesGenerator4UndiGraph.h.
using gum::learning::IGraphChangesGenerator4UndiGraph::iterator = typename Set< GraphChange >::const_iterator |
the iterator for parsing the list of possible graph change operators
Definition at line 43 of file IGraphChangesGenerator4UndiGraph.h.
|
pure virtual |
returns an (unsafe) iterator on the beginning of the list of operators
Implemented in gum::learning::GraphChangesGenerator4UndiGraph< STRUCT_CONSTRAINT >.
|
pure virtualnoexcept |
empty the set of possible change operators that can be applied
Implemented in gum::learning::GraphChangesGenerator4UndiGraph< STRUCT_CONSTRAINT >.
|
pure virtual |
returns an (unsafe) iterator on the end of the list of operators
Implemented in gum::learning::GraphChangesGenerator4UndiGraph< STRUCT_CONSTRAINT >.
|
pure virtual |
notify the operator set of a change applied to the graph
Implemented in gum::learning::GraphChangesGenerator4UndiGraph< STRUCT_CONSTRAINT >.
|
pure virtual |
notify the operator set of a change applied to the graph
Implemented in gum::learning::GraphChangesGenerator4UndiGraph< STRUCT_CONSTRAINT >.
|
pure virtual |
notify the operator set of a change applied to the graph
Implemented in gum::learning::GraphChangesGenerator4UndiGraph< STRUCT_CONSTRAINT >.
|
pure virtual |
notifies the generator that we have parsed all its legal changes
Implemented in gum::learning::GraphChangesGenerator4UndiGraph< STRUCT_CONSTRAINT >.
|
pure virtual |
sets a new graph from which the operator will compute possible changes
Implemented in gum::learning::GraphChangesGenerator4UndiGraph< STRUCT_CONSTRAINT >.