U 9v fÃã@s2dZddlZddlmZdgZedƒdd„ƒZdS)z;Function for computing the moral graph of a directed graph.éN)Únot_implemented_forÚ moral_graphZ undirectedcCs4| ¡}|j ¡D]}tj|dd}| |¡q|S)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)Z to_undirectedÚpredÚvaluesÚ itertoolsÚ combinationsZadd_edges_from)ÚGÚHÚpredsZpredecessors_combinations©r ú=/tmp/pip-unpacked-wheel-_lngutwb/networkx/algorithms/moral.pyr s + )Ú__doc__rZnetworkx.utilsrÚ__all__rr r r rÚs