Moral graph

From Wikipedia, the free encyclopedia

Given a directed acyclic graph, its moralized counterpart is formed by connecting nodes that have a common child, and then making all edges in the graph undirected.

Equivalently, a moral graph of a DAG G is an undirected graph in which each node of the original G is now connected to its Markov blanket.

For example, the moralized version of
is
where the newly added arcs are shown in red.