70#ifndef GUM_GRAPH_BAYESBALL_H
71#define GUM_GRAPH_BAYESBALL_H
88 template < GUM_DiGraphable G,
bool CollectAll >
113 template < GUM_DiGraphable G >
135 template < GUM_DiGraphable G >
C++20 concepts for aGrUM graph interfaces.
Set< NodeId > NodeSet
Some typdefs and define for shortcuts ...
NodeSet _bayesBall_(const G &g, const NodeSet &query, const NodeSet &Zhard, const NodeSet &Zsoft)
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.
NodeSet dConnected(const G &g, const NodeSet &query, const NodeSet &Zhard=NodeSet(), const NodeSet &Zsoft=NodeSet())
Returns all nodes d-connected to query given evidence.