56 template <
typename GUM_SCALAR,
57 template <
class >
class ICPTGenerator,
58 template <
class >
class ICPTDisturber >
75 "maxParents must be at least equal to 1 to have a connexe graph")
81 template <
typename GUM_SCALAR,
82 template <
class >
class ICPTGenerator,
83 template <
class >
class ICPTDisturber >
96 template <
typename GUM_SCALAR,
97 template <
class >
class ICPTGenerator,
98 template <
class >
class ICPTDisturber >
104 template <
typename GUM_SCALAR,
105 template <
class >
class ICPTGenerator,
106 template <
class >
class ICPTDisturber >
109 for (
auto node: this->
dag_.nodes())
115 template <
typename GUM_SCALAR,
116 template <
class >
class ICPTGenerator,
117 template <
class >
class ICPTDisturber >
124 template <
typename GUM_SCALAR,
125 template <
class >
class ICPTGenerator,
126 template <
class >
class ICPTDisturber >
132 "maxParents must be at least equal to 1 to have a connexe graph")
virtual bool _checkConditions_()
The boolean function that will assert the respect of the constraint.
MCBayesNetGenerator(Size nbrNodes, Size maxArcs, Idx maxModality=2, Size iteration=NB_INIT_ITERATIONS, Idx p=30, Idx q=40)
void setMaxParents(Size maxParents)
Modifies the value of the number of maximum parents imposed on the BayesNetGenerator.
Size maxParents() const
Return a constant reference to the number of maximum parents imposed on the Markov Chain BayesNetGene...
~MaxParentsMCBayesNetGenerator()
Destructor.
bool _checkConditions_() final
function to holding the the specification wanted for the Bayesian markov.
MaxParentsMCBayesNetGenerator(Size nbrNodes, Size maxArcs, Size maxModality=2, Size maxParents=1, Idx iteration=NB_INIT_ITERATIONS, Idx p=30, Idx q=40)
Constructor.
Exception : operation not allowed.
#define GUM_ERROR(type, msg)
std::size_t Size
In aGrUM, hashed values are unsigned long int.
Size Idx
Type for indexes.
Class for generating Bayesian networks using MC algorithm cf.
gum is the global namespace for all aGrUM entities