U 9v fB ã@sHdZddlmZddlZddlmZddgZedƒdd„ƒZd d„Z dS) z Dominance algorithms. é)ÚreduceN)Únot_implemented_forÚimmediate_dominatorsÚdominance_frontiersZ undirectedcs´||krt d¡‚||i‰tt ||¡ƒ}dd„t|ƒDƒ‰| ¡| ¡‡‡fdd„}d}|r°d}|D]B}t|‡fdd „|j|Dƒƒ}|ˆks ˆ||krj|ˆ|<d}qjq^ˆS) a'Returns the immediate dominators of all nodes of a directed graph. Parameters ---------- G : a DiGraph or MultiDiGraph The graph where dominance is to be computed. start : node The start node of dominance computation. Returns ------- idom : dict keyed by nodes A dict containing the immediate dominators of each node reachable from `start`. Raises ------ NetworkXNotImplemented If `G` is undirected. NetworkXError If `start` is not in `G`. Notes ----- Except for `start`, the immediate dominators are the parents of their corresponding nodes in the dominator tree. Examples -------- >>> G = nx.DiGraph([(1, 2), (1, 3), (2, 5), (3, 4), (4, 5)]) >>> sorted(nx.immediate_dominators(G, 1).items()) [(1, 1), (2, 1), (3, 1), (4, 3), (5, 1)] References ---------- .. [1] K. D. Cooper, T. J. Harvey, and K. Kennedy. A simple, fast dominance algorithm. Software Practice & Experience, 4:110, 2001. zstart is not in GcSsi|]\}}||“qS©r)Ú.0ÚiÚurrúA/tmp/pip-unpacked-wheel-_lngutwb/networkx/algorithms/dominance.pyÚ >sz(immediate_dominators..csB||kr>ˆ|ˆ|kr"ˆ|}qˆ|ˆ|krˆ|}q"q|S©Nr)r Úv©ÚdfnÚidomrr Ú intersectBs   z'immediate_dominators..intersectTFc3s|]}|ˆkr|VqdSr r)rr )rrr Ú Nsz'immediate_dominators..) ÚnxZ NetworkXErrorÚlistZdfs_postorder_nodesÚ enumerateÚpopÚreverserÚpred)ÚGÚstartÚorderrÚchangedr Znew_idomrrr r s"+ cCsvt ||¡}dd„|Dƒ}|D]R}t|j|ƒdkr|j|D]0}||kr>|||kr>|| |¡||}qJq>q|S)aÂReturns the dominance frontiers of all nodes of a directed graph. Parameters ---------- G : a DiGraph or MultiDiGraph The graph where dominance is to be computed. start : node The start node of dominance computation. Returns ------- df : dict keyed by nodes A dict containing the dominance frontiers of each node reachable from `start` as lists. Raises ------ NetworkXNotImplemented If `G` is undirected. NetworkXError If `start` is not in `G`. Examples -------- >>> G = nx.DiGraph([(1, 2), (1, 3), (2, 5), (3, 4), (4, 5)]) >>> sorted((u, sorted(df)) for u, df in nx.dominance_frontiers(G, 1).items()) [(1, []), (2, [5]), (3, [5]), (4, [5]), (5, [])] References ---------- .. [1] K. D. Cooper, T. J. Harvey, and K. Kennedy. A simple, fast dominance algorithm. Software Practice & Experience, 4:110, 2001. cSsi|] }|tƒ“qSr)Úset)rr rrr r }sz'dominance_frontiers..é)rrÚlenrÚadd)rrrZdfr r rrr rVs%  ) Ú__doc__Ú functoolsrZnetworkxrZnetworkx.utilsrÚ__all__rrrrrr Ús   H