hz SrSSKJr SSKrSSKJr SS/r\"S5\RS55r \RS 5r g) z Dominance algorithms. )reduceN)not_implemented_forimmediate_dominatorsdominance_frontiers undirectedc^^ X;a[R"S5eX0m [[R"X55n[ U5VVs0sHup4XC_M snnmUR 5 UR 5 UU 4SjnSnU(aOSnUH>n[UU 4SjURU55nUT ;d T UU:wdM7UT U'SnM@ U(aMOT $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`. 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 Gc>X:waETUTU:aTUnTUTU:aMTUTU:aTUnTUTU:aMX:waMEU$N)uvdfnidoms O/var/www/html/env/lib/python3.13/site-packages/networkx/algorithms/dominance.py intersect'immediate_dominators..intersectCshfa&3q6/Ga&3q6/a&3q6/Ga&3q6/f TFc36># UHoT;dM Uv M g7fr r ).0r rs r 'immediate_dominators..Os)LYt)!!Ys  ) nx NetworkXErrorlistdfs_postorder_nodes enumeratepopreverserpred) Gstartorderir rchangednew_idomrrs @@rrr sX ~233 >D ''1 2E%e, -,DA14, -C IIK MMOG Ai)LQVVAY)LMH}Q8 3"Q  ' K+ .sC!cN[R"X5nUVs0sH o3[5_M nnUHin[URU5S:dM!URUH5nXR;dM XRU:wdMXER U5 X%nXRU:waM!M7 Mk 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 )rrsetlenradd)r r!rr dfr s rrrWsL  " "1 ,D !DqSU(DB !  qvvay>Q VVAY9Aw, !  GAw, I "sB") __doc__ functoolsrnetworkxrnetworkx.utilsr__all__ _dispatchablerrr rrr2sd. !#8 9\"E#EP//r