The BayesBall algorithm (as described by Schachter).
Implementation of the BayesBall class.
Generic Bayes Ball algorithm (Shachter 1998) for directed graphs.
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.
Set< NodeId > NodeSet
Some typdefs and define for shortcuts ...
NodeSet requisiteNodes(const G &g, const NodeSet &query, const NodeSet &Zhard=NodeSet(), const NodeSet &Zsoft=NodeSet())
Returns the Shachter-requisite nodes for query given evidence.
gum is the global namespace for all aGrUM entities