github.com/zhtmike/d-separation (go): Package dsep finds all D-separeted nodes from a given node in O(n) time complexity.  Reference: Daphne Koller and Nir Friedman, Probabilistic Graphical Models Principles and Techniques, p74-75.  This example creates a Baysian network, where node-0 has two parents: node-1 and node-2, when node-0 is not observed, node-1 is D-separated from node-2.
Keywords: baysian-network|d-seperate