\Mhz dZddlmZddlZddlmZddgZedejdZ ejd Z dS) z Dominance algorithms. )reduceN)not_implemented_forimmediate_dominatorsdominance_frontiers undirectedc||vrtjd||ittj||}dt |D||fd}d}|rGd}|D]@}t|fd|j|D}|vs ||kr||<d}A|GS)a1Returns 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] Cooper, Keith D., Harvey, Timothy J. and Kennedy, Ken. "A simple, fast dominance algorithm." (2006). https://hdl.handle.net/1911/96345 zstart is not in Gci|]\}}|| Sr ).0ius ]/var/www/html/test/jupyter/venv/lib/python3.11/site-packages/networkx/algorithms/dominance.py z(immediate_dominators..?s - - -DAq1a - - -c||kr^||kr|}||k||kr|}||k||k^|SNr )r vdfnidoms r intersectz'immediate_dominators..intersectCsx1ffa&3q6//Ga&3q6//a&3q6//Ga&3q6//1ff rTFc3$K|] }|v|V dSrr )r rrs r z'immediate_dominators..Os')L)L!t))!)))))L)Lr) nx NetworkXErrorlistdfs_postorder_nodes enumeratepopreverserpred) Gstartorderrchangedr new_idomrrs @@rrr sX A~~2333 5>D '511 2 2E - -Ie,, - - -C IIKKK MMOOOG   Ai)L)L)L)LQVAY)L)L)LMMH}}Q8 3 3"Q  Krc,tj||}d|D}|D]o}t|j|dkrO|j|D]A}||vr;|||kr/|||||}|||k/Bp|S)aReturns 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] Cooper, Keith D., Harvey, Timothy J. and Kennedy, Ken. "A simple, fast dominance algorithm." (2006). https://hdl.handle.net/1911/96345 c,i|]}|tSr )set)r r s rrz'dominance_frontiers..s ! ! !q!SUU ! ! !r)rrlenr add)r!r"rdfr rs rrrWsL  "1e , ,D ! !D ! ! !B $$ qvay>>Q  VAY $ $99tAw,,1 !  GtAw,, Ir) __doc__ functoolsrnetworkxrnetworkx.utilsr__all__ _dispatchablerrr rrr3s...... !#8 9\""EE#"EP/////r