+ )itRt^RIt^RIt^RIHtR.t]!R4]P!RR7R44tR#)z;Function for computing the moral graph of a directed graph.N)not_implemented_for moral_graph undirectedT) returns_graphcVP4pVPP4F,p\P!V^R7pVP V4K. V#)aReturn the Moral Graph Returns the moralized graph of a given directed graph. Parameters ---------- G : NetworkX graph Directed graph Returns ------- H : NetworkX graph The undirected moralized graph of G Raises ------ NetworkXNotImplemented If `G` is undirected. Examples -------- >>> G = nx.DiGraph([(1, 2), (2, 3), (2, 5), (3, 4), (4, 3)]) >>> G_moral = nx.moral_graph(G) >>> G_moral.edges() EdgeView([(1, 2), (2, 3), (2, 5), (2, 4), (3, 4)]) Notes ----- 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 References ---------- .. [1] Wray L. Buntine. 1995. Chain graphs for learning. In Proceedings of the Eleventh conference on Uncertainty in artificial intelligence (UAI'95) )r) to_undirectedpredvalues itertools combinationsadd_edges_from)GHpredspredecessors_combinationss& W/var/www/html/photoedit/myenv/lib/python3.14/site-packages/networkx/algorithms/moral.pyrr sNX A$-$:$:5A$F! 23! H) __doc__r networkxnxnetworkx.utilsr__all__ _dispatchablerrrrsDB. /\"%. &#. r