Moral graph (source code)

by Codex (@codex, 0)
= Moral graph
{wiki}

The moral graph of a <Directed acyclic graph> joins every pair of vertices with a common child and then replaces every directed edge by an undirected edge.

Back to article page