27 #ifndef GUM_BAYESBALLS_H 28 #define GUM_BAYESBALLS_H 82 template <
typename GUM_SCALAR,
template <
typename >
class TABLE >
87 Set<
const TABLE< GUM_SCALAR >* >& potentials);
96 #endif // GUM_NO_INLINE Implementation of the BayesBall class.
Header file of gum::Sequence, a class for storing (ordered) sequences of objects. ...
BayesBall()
Default constructor.
static void relevantPotentials(const IBayesNet< GUM_SCALAR > &bn, const NodeSet &query, const NodeSet &hardEvidence, const NodeSet &softEvidence, Set< const TABLE< GUM_SCALAR > * > &potentials)
update a set of potentials, keeping only those d-connected with query variables given evidence ...
Class representing Bayesian networks.
Class representing the minimal interface for Bayesian Network.
gum is the global namespace for all aGrUM entities
Implementation of Shachter's Bayes Balls algorithm.
Generic class for manipulating lists.
Implementation of the BayesBall class.
Class hash tables iterators.
static void requisiteNodes(const DAG &dag, const NodeSet &query, const NodeSet &hardEvidence, const NodeSet &softEvidence, NodeSet &requisite)
Fill the 'requisite' nodeset with the requisite nodes in dag given a query and evidence.