+ jARt^RIt^RItRR.t]P !RR7RRl4t]P R Rl4tR#) zT Provides functions for finding and testing for locally `(k, l)`-connected graphs. Nkl_connected_subgraphis_kl_connectedT) returns_graphc\P!V4pRpRpV'Ed:Rp\VP44EFpVwrV'ddW0p \ V4F1p V P4Fp V P W ,4K K3 VP V 4P4pM\P!V4pW.p^p^pV'dVV^, pVV8d^pMBT pVF p VV 8wgK VPVV 4T pK" \P!WV 4pK]V^8XgKVPW4RpV'gEKRpEK EKBV'dWV3#V# \PdRpKi;i)aReturns the maximum locally `(k, l)`-connected subgraph of `G`. A graph is locally `(k, l)`-connected if for each edge `(u, v)` in the graph there are at least `l` edge-disjoint paths of length at most `k` joining `u` to `v`. Parameters ---------- G : NetworkX graph The graph in which to find a maximum locally `(k, l)`-connected subgraph. k : integer The maximum length of paths to consider. A higher number means a looser connectivity requirement. l : integer The number of edge-disjoint paths. A higher number means a stricter connectivity requirement. low_memory : bool If this is True, this function uses an algorithm that uses slightly more time but less memory. same_as_graph : bool If True then return a tuple of the form `(H, is_same)`, where `H` is the maximum locally `(k, l)`-connected subgraph and `is_same` is a Boolean representing whether `G` is locally `(k, l)`-connected (and hence, whether `H` is simply a copy of the input graph `G`). Returns ------- NetworkX graph or two-tuple If `same_as_graph` is True, then this function returns a two-tuple as described above. Otherwise, it returns only the maximum locally `(k, l)`-connected subgraph. See also -------- is_kl_connected References ---------- .. [1] Chung, Fan and Linyuan Lu. "The Small World Phenomenon in Hybrid Power Law Graphs." *Complex Networks*. Springer Berlin Heidelberg, 2004. 89--104. TF) copydeepcopylistedgesrangeupdatesubgraph remove_edgenx shortest_pathNetworkXNoPath)Gkl low_memory same_as_graphHgraphOK deleted_someedgeuvvertsiwG2pathcntacceptprevs&&&&& [/home/luca/screen-checking/.venv/lib/python3.14/site-packages/networkx/algorithms/hybrid.pyrrsaf aAGL , ODFQqA"ZZ\ QT**"ZZ&++-]]1%6DCFq!8FAqytQ/  !++B15D{ a## 7#GI$N| H((! D!sE**FFc bRpVP4FpVwrgV'ddWg0p\V4F?p VP4U u.uF"qPVP V 44NK$ p KA VP V4p M\P !V4p Wg.p ^p ^pV 'dSV ^, p W8d^pM@TpV Fp W8wgK V PW4T pK \P!WV4p KZV^8XgKRpV# V#uup i \PdRp Ki;i)aReturns True if and only if `G` is locally `(k, l)`-connected. A graph is locally `(k, l)`-connected if for each edge `(u, v)` in the graph there are at least `l` edge-disjoint paths of length at most `k` joining `u` to `v`. Parameters ---------- G : NetworkX graph The graph to test for local `(k, l)`-connectedness. k : integer The maximum length of paths to consider. A higher number means a looser connectivity requirement. l : integer The number of edge-disjoint paths. A higher number means a stricter connectivity requirement. low_memory : bool If this is True, this function uses an algorithm that uses slightly more time but less memory. Returns ------- bool Whether the graph is locally `(k, l)`-connected subgraph. See also -------- kl_connected_subgraph References ---------- .. [1] Chung, Fan and Linyuan Lu. "The Small World Phenomenon in Hybrid Power Law Graphs." *Complex Networks*. Springer Berlin Heidelberg, 2004. 89--104. TF) r r rr neighborsr rr rrr)rrrrrrrrrrrrr r!r"r#s&&&& r$rrws#RG  FE1X7r-s[   "$5 6%e &e PLLr,