:j9dZddlmZddlZddlmZddgZedejdZ edejd Z y) z Dominance algorithms. )reduceN)not_implemented_forimmediate_dominatorsdominance_frontiers undirectedc ||vrtjd|di ttj||}t |Dcic]\}}|| c}}|j |j  fd}d}|rBd}|D]8}t| fd|j|D}| vs ||k7s2| |<d}:|rB |= Scc}}w)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||k7r>||kr|}||kr||kDr|}||kDr||k7r>|SN)uvdfnidoms r/home/mcse/projects/srt_converter/srt-converter-venv/lib/python3.12/site-packages/networkx/algorithms/dominance.py intersectz'immediate_dominators..intersectHsl1fa&3q6/Ga&3q6/a&3q6/Ga&3q6/1f TFc3,K|] }|vs| ywr r ).0r rs r z'immediate_dominators..Ts)L!t)!)Ls ) nx NetworkXErrorlistdfs_postorder_nodes enumeratepopreverserpred) Gstartorderir rchangednew_idomrrs @@rrr sb A~233 4=D ''51 2E%e, -DAq1a4 -C IIK MMOG  Ai)LQVVAY)LMH}Q8 3"Q    U K- .s CcNtj|||diz}|Dcic] }|t}}|D]g}||k(st|j|dk\s$|j|D]2}||vs|||k7s||j |||}|||k7r"4i|Scc}w)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 N)rrsetlenradd)rrrr dfr s rrr]sN  " "1e ,t} r0sq. !#8 9\"K#K\\"/#/r