+ )i9Rt^RIHt^RIt^RIHtRR.t]!R4]PR44t ]!R4]PR44t R#) z Dominance algorithms. )reduceN)not_implemented_forimmediate_dominatorsdominance_frontiers undirectedcaa W9d\P!R4hVR/o \\P!W44p\ V4UUu/uFwr4WCbK uppoVP 4VP 4VV 3RlpRpV'dSRpVFHp\VV 3RlVPV,44pVS 9gS V,V8wgKAVS V&RpKJ KZS VS #uuppi)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<W8wdCSV,SV,8d SV,pK SV,SV,8gK=SV,pK"V#N)uvdfnidoms&&[/var/www/html/photoedit/myenv/lib/python3.14/site-packages/networkx/algorithms/dominance.py intersect'immediate_dominators..intersectHs=fa&3q6/Ga&3q6/GTFc38<"TFqS9gK VxK R#5ir r ).0r rs& r 'immediate_dominators..Ts)LYt)!!Ys ) nx NetworkXErrorlistdfs_postorder_nodes enumeratepopreverserpred) Gstartorderir rchangednew_idomr rs && @@rrr sb ~233 4=D ''1 2E%e, -,DA14, -C IIK MMOG Ai)LQVVAY)LMH}Q8 3"Q  U K- .s C)c\P!W4VR/,pVUu/uF q3\4bK ppVF|pW18Xg$\VPV,4^8gK,VPV,F9pWR9gK WRV,8wgKWE,P V4W%,pK0 K~ V#uupi)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)rr rr dfr s&& rrr]sN  " "1 ,t} r0sq. !#8 9\"K#K\\"/#/r