moral_graph(G)
Returns the moralized graph of a given directed graph.
A moral graph is an undirected graph H = (V, E) generated from a directed Graph, where if a node has more than one parent node, edges between these parent nodes are inserted and all directed edges become undirected.
https://en.wikipedia.org/wiki/Moral_graph
Directed graph
If G is undirected.
The undirected moralized graph of G
Return the Moral Graph
>>> G = nx.DiGraph([(1, 2), (2, 3), (2, 5), (3, 4), (4, 3)])See :
... G_moral = nx.moral_graph(G)
... G_moral.edges() EdgeView([(1, 2), (2, 3), (2, 5), (2, 4), (3, 4)])
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.algorithms.moral.moral_graph
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them