Base class for undirected graphs.
The base class for structural constraints used by learning algorithms that learn an undirected graph ...
virtual ~StructuralConstraintUndiGraph()
destructor
UndiGraph _UndiGraph_graph_
the UndiGraph on which we perform checks
StructuralConstraintUndiGraph & operator=(const StructuralConstraintUndiGraph &from)
copy operator
void setGraph(Size nb_nodes)
sets a new empty graph from which we will perform checkings
StructuralConstraintUndiGraph()
default constructor
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
the base class for structural constraints used by learning algorithms that learn an undirected graph ...
the base class for structural constraints used by learning algorithms that learn an undirected graph ...