Skip to main content
. 2020 Jul 31;22(8):854. doi: 10.3390/e22080854
Algorithm A1 d-Separation [45].

     Input: DAG G=(V,E) and disjoint sets A,B,C⊂V

  • 1:

    Create a subgraph containing only nodes in A, B, or C or with a directed path to A, B, or C

  • 2:

    Connect with an undirected edge any two variables that share a common child

  • 3:

    For each c∈C, remove c and any edge connected to c

  • 4:

    Make every edge an undirected edge

  • 5:

    Conclude that A and B are d-separated by C if and only if there is no path connecting A and B