\MhAzdZddlZddlZddgZejdd dZejd d ZdS) zT Provides functions for finding and testing for locally `(k, l)`-connected graphs. Nkl_connected_subgraphis_kl_connectedT) returns_graphFctj|}d}d}|rFd}t|D]}|\} } |rp| | h} t |D]4} | D]} | || 5|| }ntj|}| | g}d}d}|rd|dz }||krd}nV| }|D] } || kr||| | }! tj || | }n#tj $rd}YnwxYw|d|dkr|| | d}|rd} |F|r||fS|S)aMReturns 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 Z/var/www/html/test/jupyter/venv/lib/python3.11/site-packages/networkx/algorithms/hybrid.pyrrsf aAGL *$ OO$ $$ $DFQ &Aq++A"ZZ\\++ QqT****+ZZ&&++--]1%%q6DCF !q!88F!!AqyytQ/// !+B155DD(!!! DDD! !"{{ a#### $#GU *$Z7| Hs D""D65D6cd}D]}|\}}|rM||ht|D]#}fdD$} ntj} ||g} d} d} | rd| dz } | |krd} nV|} | D] }|| kr| | ||} ! t j| ||} n#t j$rd} YnwxYw| d| dkrd}n|S)aYReturns 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. Tc`g|]*}|+S)r neighbors).0r rrs r& z#is_kl_connected..s/DDD!akk!nn--DDDrrF) r r rrr rrrr)rrrrrrrrrr!r"r#r$r%r rs` @r&rrwswRG !!A  "FE1XX E EDDDDDuzz||DDDDDE""BBq!!B1v  1HCaxxD  99NN4+++D 'Aq11$     " Q;;G E  NsCC,+C,)FF)F)__doc__rnetworkxr__all__ _dispatchablerrr)r-r&r2s   "$5 6%%%e e e &%e PLLLLLLr-