48#ifndef GUM_LEARNING_STRUCTURAL_CONSTRAINT_UNDIGRAPH_H
49#define GUM_LEARNING_STRUCTURAL_CONSTRAINT_UNDIGRAPH_H
181#ifndef DOXYGEN_SHOULD_SKIP_THIS
185# define GUM_CONSTRAINT_CLASS_NAME StructuralConstraintUndiGraph
187# undef GUM_CONSTRAINT_CLASS_NAME
Base class for undirected graphs.
The class for notifying learning algorithms of new edge additions.
The class for notifying learning algorithms of edge removals.
virtual ~StructuralConstraintUndiGraph()
destructor
bool checkEdgeDeletionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to remove edge (x,y)
UndiGraph _UndiGraph_graph_
the UndiGraph on which we perform checks
void setGraphAlone(const UndiGraph &graph)
sets a new graph from which we will perform checkings
void modifyGraphAlone(const GraphChange &change)
notify the constraint of a modification of the graph
void modifyGraphAlone(const EdgeAddition &change)
notify the constraint of a modification of the graph
void modifyGraphAlone(const EdgeDeletion &change)
notify the constraint of a modification of the graph
bool checkEdgeAdditionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to add edge (x,y)
StructuralConstraintUndiGraph & operator=(const StructuralConstraintUndiGraph &from)
copy operator
bool checkModificationAlone(const EdgeDeletion &change) const
checks whether the constraints enable to remove an edge
void setGraph(Size nb_nodes)
sets a new empty graph from which we will perform checkings
StructuralConstraintUndiGraph()
default constructor
bool isAlwaysInvalidAlone(const GraphChange &change) const
indicates whether a change will always violate the constraint
bool checkModificationAlone(const EdgeAddition &change) const
checks whether the constraints enable to add an edge
bool checkModificationAlone(const GraphChange &change) const
checks whether the constraints enable to perform a graph change
std::size_t Size
In aGrUM, hashed values are unsigned long int.
Size NodeId
Type for node ids.
include the inlined functions if necessary
gum is the global namespace for all aGrUM entities
the base class for all structural constraints
the base class for structural constraints used by learning algorithms that learn an undirected graph ...
the base class for all structural constraints
Base classes for undirected graphs.