Go D-Seperation

An algorithm implementation for finding all D-separated nodes in a belief network

Reference: Daphne Koller and Nir Friedman, Probabilistic Graphical Models Principles and Techniques, p74-75.

Examples

For a simple belief network, e.g. 1 --> 0 <-- 2, node-1 and node-2 is conditionally independent when node-0 is not observed.