~iAxSrSSKrSSKrSS/r\R "SS9S Sj5r\R S Sj5rg) zT Provides functions for finding and testing for locally `(k, l)`-connected graphs. Nkl_connected_subgraphis_kl_connectedT) returns_graphc[R"U5nSnSnU(Ga9Sn[UR55GHnUupU(a_X1n [ U5H-n U R5Hn U R X 5 M M/ UR U 5R5nO[R"U5nX/nSnSnU(aVUS- nUU:aSnOHU nUHn UU :wdM URUU 5 U nM! [R"XU 5nU(aMVUS:XdMURX5 SnU(dGM SnGM U(aGM9U(aXV4$U$![Ra SnNcf=f)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. TFr) copydeepcopylistedgesrangeupdatesubgraph remove_edgenx shortest_pathNetworkXNoPath)Gkl low_memory same_as_graphHgraphOK deleted_someedgeuvvertsiwG2pathcntacceptprevs W/home/mande/repo/quber/.venv/lib/python3.13/site-packages/networkx/algorithms/hybrid.pyrrsmf aAGL  ODFQqA"ZZ\ QT**"ZZ&++-]]1%6DCFq!8FAqytQ/  !++B15D$"{ a## 7#GI$ ,Z| H((! D!sE((FFc \SnUR5HnUupgU(adXg1n[U5H@n UR5V s/sH"oRUR U 55PM$ n MB UR U5n O[R "U5n Xg/n Sn SnU (aSU S- n X:aSnOFUnU Hn X:wdM U RX5 U nM [R"XU5n U (aMSUS:XdMSn U$ U$s sn f![Ra Sn N7f=f)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. TrrF) r r rr neighborsrr rrrr)rrrrrrrrrrr r!r"r#r$r%s r&rrws*RG  FE1X7r/s[   "$5 6%e &e PLLr.