75#ifndef GUM_LEARNING_GRAPH_CHANGES_GENERATOR_4_UNDIGRAPH_H
76#define GUM_LEARNING_GRAPH_CHANGES_GENERATOR_4_UNDIGRAPH_H
128 template <
typename STRUCT_CONSTRAINT >
The base class for all GraphChangesGenerators for undirected structures.
SetIterator< Key > const_iterator
Types for STL compliance.
Base class for undirected graphs.
The class for notifying learning algorithms of new edge additions.
The class for notifying learning algorithms of edge removals.
GraphChangesGenerator4UndiGraph< STRUCT_CONSTRAINT > & operator=(GraphChangesGenerator4UndiGraph< STRUCT_CONSTRAINT > &&from)
move operator
void createChanges_()
create the set of legal and illegal changes from a given graph
void setGraph(const UndiGraph &graph)
sets a new graph from which the operator will compute possible changes
typename Set< GraphChange >::const_iterator iterator
the iterator for parsing the list of possible graph change operators
void setMaxNbThreads(Size nb) noexcept
sets the maximum number of threads used to compute the set of changes
Set< GraphChange > legal_changes_
the current set of operators
void modifyGraph(const EdgeAddition &change)
notify the operator set of a change applied to the graph
void clearChanges() noexcept
empty the set of possible change operators that can be applied
iterator const_iterator
the const iterator for parsing the list of graph change operators
GraphChangesGenerator4UndiGraph< STRUCT_CONSTRAINT > & operator=(const GraphChangesGenerator4UndiGraph< STRUCT_CONSTRAINT > &from)
copy operator
iterator begin() const
returns an (unsafe) iterator on the beginning of the list of operators
GraphChangesGenerator4UndiGraph(const GraphChangesGenerator4UndiGraph< STRUCT_CONSTRAINT > &from)
copy constructor
STRUCT_CONSTRAINT * constraint_
a reference on the structural constraint used to restrict the changes
STRUCT_CONSTRAINT & constraint() const noexcept
returns the constraint that is used by the generator
GraphChangesGenerator4UndiGraph(GraphChangesGenerator4UndiGraph< STRUCT_CONSTRAINT > &&from)
move operator
const iterator & end() const
returns an (unsafe) iterator on the end of the list of operators
void notifyGetCompleted()
notifies the generator that we have parsed all its legal changes
virtual ~GraphChangesGenerator4UndiGraph()
destructor
Size _max_threads_number_
the max number of threads authorized
UndiGraph graph_
the graph on which we generate operators
GraphChangesGenerator4UndiGraph(STRUCT_CONSTRAINT &constraint)
default constructor
The basic class for computing the next graph changes possible in an undirected structure learning alg...
std::size_t Size
In aGrUM, hashed values are unsigned long int.
include the inlined functions if necessary
gum is the global namespace for all aGrUM entities
unsigned int getNumberOfThreads()
returns the max number of threads used by default when entering the next parallel region
The class to use to execute a function by several threads.
Utility functions used for exploiting OpenMP/STL parallelism.