9i9SrSSKJr SSKrSSKJr SS/r\"S5\RS55r \"S5\RS 55r g) z Dominance algorithms. )reduceN)not_implemented_forimmediate_dominatorsdominance_frontiers undirectedc^^ X;a[R"S5eUS0m [[R"X55n[ U5VVs0sHup4XC_M snnmUR 5 UR 5 UU 4SjnSnU(aOSnUH>n[UU 4SjURU55nUT ;d T UU:wdM7UT U'SnM@ U(aMOT U T $s snnf)aReturns 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`, except for `start` itself. Raises ------ NetworkXNotImplemented If `G` is undirected. NetworkXError If `start` is not in `G`. Notes ----- The immediate dominators are the parents of their corresponding nodes in the dominator tree. Every node reachable from `start` has an immediate dominator, except for `start` itself. Examples -------- >>> G = nx.DiGraph([(1, 2), (1, 3), (2, 5), (3, 4), (4, 5)]) >>> sorted(nx.immediate_dominators(G, 1).items()) [(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 .. [2] Lengauer, Thomas; Tarjan, Robert Endre (July 1979). "A fast algorithm for finding dominators in a flowgraph". ACM Transactions on Programming Languages and Systems. 1 (1): 121--141. https://dl.acm.org/doi/10.1145/357062.357071 zstart is not in GNc>X:waETUTU:aTUnTUTU:aMTUTU:aTUnTUTU:aMX:waMEU$N)uvdfnidoms ]/var/www/html/land-doc-ocr/venv/lib/python3.13/site-packages/networkx/algorithms/dominance.py intersect'immediate_dominators..intersectHshfa&3q6/Ga&3q6/a&3q6/Ga&3q6/f TFc36># UHoT;dM Uv M g7fr r ).0r rs r 'immediate_dominators..Ts)LYt)!!Ys  ) nx NetworkXErrorlistdfs_postorder_nodes enumeratepopreverserpred) Gstartorderir rchangednew_idomrrs @@rrr sb ~233 4=D ''1 2E%e, -,DA14, -C IIK MMOG Ai)LQVVAY)LMH}Q8 3"Q  ' U K- .sC%cb[R"X5US0-nUVs0sH o3[5_M nnUHnnX1:Xd[URU5S:dM&URUH5nXR;dM XRU:wdMXER U5 X%nXRU:waM!M7 Mp U$s snf)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] Cooper, Keith D., Harvey, Timothy J. and Kennedy, Ken. "A simple, fast dominance algorithm." (2006). https://hdl.handle.net/1911/96345 N)rrsetlenradd)r r!rr dfr s rrr]sN  " "1 ,t} r2sq. !#8 9\"K#K\\"/#/r