63#ifndef GUM_GRAPH_SEPARATION_H
64#define GUM_GRAPH_SEPARATION_H
87 template < GUM_DiGraphable G >
105 template < GUM_DiGraphable G >
127 template < GUM_MixedGraphable G >
144 template < GUM_MixedGraphable G >
Generic Bayes Ball algorithm (Shachter 1998) for directed graphs.
Size NodeId
Type for node ids.
Set< NodeId > NodeSet
Some typdefs and define for shortcuts ...
Moralization algorithms for aGrUM directed and mixed graphs.
bool cSeparated(const G &g, NodeId X, NodeId Y, const NodeSet &Z)
Returns true iff X and Y are c-separated by Z in g.
bool dSeparated(const G &g, NodeId X, NodeId Y, const NodeSet &Z)
Returns true iff X and Y are d-separated by Z in g.