خوارزمية عن D-separation In Graph

Formally, a channel between X and Y is blocked by a

Z set of nodes if there is a node W in this channel

checking one of the conditions:

- W is not a converging node W is in Z

- W is a node converge neither W, nor any of its descendants are

in Z.

• Two nodes X and Y are called d-separated by Z in the graph

G, DsepG (X, Y | Z), if all the channels (single) between X and Y

blocked by Z