Moralizing a DAG involves connecting all parents of each node and then converting all directed edges into undirected edges.
Details
This changes the graph from a Directed Acyclic Graph (DAG) to an Undirected Graph (UG), also known as a Markov Graph.
See also
Other operations:
mutate_caugi(),
skeleton()