gum::learning::IGraphChangesGenerator4UndiGraph Class Reference

#include <IGraphChangesGenerator4UndiGraph.h>

Inheritance diagram for gum::learning::IGraphChangesGenerator4UndiGraph:

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 iterator &	end () const =0
	returns an (unsafe) iterator on the end of the list of operators
Accessors / Modifiers
virtual void	setGraph (const UndiGraph &graph)=0
	sets a new graph from which the operator will compute possible changes
virtual void	modifyGraph (const EdgeAddition &change)=0
	notify the operator set of a change applied to the graph
virtual void	modifyGraph (const EdgeDeletion &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 60 of file IGraphChangesGenerator4UndiGraph.h.

Member Typedef Documentation

const_iterator

using gum::learning::IGraphChangesGenerator4UndiGraph::const_iterator = iterator

the const iterator for parsing the list of graph change operators

Definition at line 66 of file IGraphChangesGenerator4UndiGraph.h.

iterator

using gum::learning::IGraphChangesGenerator4UndiGraph::iterator = typename Set< GraphChange >::const_iterator

the iterator for parsing the list of possible graph change operators

Definition at line 63 of file IGraphChangesGenerator4UndiGraph.h.

Member Function Documentation

begin()

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 >.

clearChanges()

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 >.

end()

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 >.

modifyGraph() [1/3]

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 >.

modifyGraph() [2/3]

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 >.

modifyGraph() [3/3]

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 >.

notifyGetCompleted()

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 >.

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::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:

• agrum/BN/learning/structureUtils/IGraphChangesGenerator4UndiGraph.h