69#ifndef GUM_LEARNING_GRAPH_CHANGES_GENERATOR_ON_SUBDIGRAPH_H
70#define GUM_LEARNING_GRAPH_CHANGES_GENERATOR_ON_SUBDIGRAPH_H
112 template <
typename STRUCT_CONSTRAINT >
The base class for all GraphChangesGenerators for directed structures.
Base class for all oriented graphs.
SetIterator< Key > const_iterator
Types for STL compliance.
The class for notifying learning algorithms of new arc additions.
The class for notifying learning algorithms of arc removals.
The class for notifying learning algorithms of arc reversals.
NodeSet tail_nodes_
the tail nodes (other extremities than the targets)
Set< GraphChange > legal_changes_
the current set of operators
GraphChangesGeneratorOnSubDiGraph(STRUCT_CONSTRAINT &constraint)
default constructor
STRUCT_CONSTRAINT & constraint() const noexcept
returns the constraint that is used by the generator
void clearChanges() noexcept
empty the set of possible change operators that can be applied
GraphChangesGeneratorOnSubDiGraph(const GraphChangesGeneratorOnSubDiGraph< STRUCT_CONSTRAINT > &from)
copy constructor
GraphChangesGeneratorOnSubDiGraph< STRUCT_CONSTRAINT > & operator=(const GraphChangesGeneratorOnSubDiGraph< STRUCT_CONSTRAINT > &from)
copy operator
void eraseTarget(NodeId node)
removes a target
void addTarget(NodeId node)
adds a new target node
void createChanges_()
create the set of legal and illegal changes from a given graph
typename Set< GraphChange >::const_iterator iterator
the iterator for parsing the list of possible graph change operators
iterator const_iterator
the const iterator for parsing the list of graph change operators
void notifyGetCompleted()
notifies the generator that we have parsed all its legal changes
void setGraph(const DiGraph &graph)
sets a new graph from which the operator will compute possible changes
void setTails(const NodeSet &nodes)
assign a set of "tail" nodes
iterator begin() const
returns an (unsafe) iterator on the beginning of the list of operators
STRUCT_CONSTRAINT * constraint_
a reference on the structural constraint used to restrict the changes
virtual ~GraphChangesGeneratorOnSubDiGraph()
destructor
void addTail(NodeId node)
adds a new "tail" node
const iterator & end() const
returns an (unsafe) iterator on the end of the list of operators
NodeSet target_nodes_
the set of target nodes
void setMaxNbThreads(Size nb) noexcept
sets the maximum number of threads used to compute the set of changes
Size _max_threads_number_
the max number of threads authorized
void modifyGraph(const ArcAddition &change)
notify the operator set of a change applied to the graph
GraphChangesGeneratorOnSubDiGraph(GraphChangesGeneratorOnSubDiGraph< STRUCT_CONSTRAINT > &&from)
move operator
void eraseTail(NodeId node)
removes a tail node
GraphChangesGeneratorOnSubDiGraph< STRUCT_CONSTRAINT > & operator=(GraphChangesGeneratorOnSubDiGraph< STRUCT_CONSTRAINT > &&from)
move operator
void setTargets(const NodeSet &nodes)
assign a set of target nodes
The class for computing the set of graph changes (over a subgraph) transmitted to learning algorithms...
std::size_t Size
In aGrUM, hashed values are unsigned long int.
Size NodeId
Type for node ids.
Set< NodeId > NodeSet
Some typdefs and define for shortcuts ...
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.