o hA@sFdZddlZddlZddgZejddd ddZejd d dZdS) zT Provides functions for finding and testing for locally `(k, l)`-connected graphs. Nkl_connected_subgraphis_kl_connectedT) returns_graphFc Cs8t|}d}d}|rd}t|D]~}|\} } |r<| | h} t|D]} | D] } | || q)q#|| }nt|}| | g}d}d}|r|d7}||krVd}n+| }|D]} || krh||| | }qZz t || | }Wn tj y~d}Ynw|sK|dkr|| | d}|rd}q|s |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_someedgeuvvertsiwG2pathcntacceptprevr$n/var/www/html/construction_image-detection-poc/venv/lib/python3.10/site-packages/networkx/algorithms/hybrid.pyrsZ 3     -c sd}D]s}|\}}|r+||ht|D]}fddDq} nt} ||g} d} d} | rp| d7} | |krEd} n+|} | D]}|| krW| | ||} qIz t| ||} Wn tjymd} Ynw| s:| dkryd}|Sq|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. Tcsg|] }|qSr$)r neighbors).0rrrr$r% sz#is_kl_connected..rrF) r r rr rr rrr)rrrrrrrrrrr r!r"r#rr$r(r%rwsF)     )FF)F)__doc__rnetworkxr__all__ _dispatchablerrr$r$r$r%s  h