o ›Ç h˜9ã@sždZddlZddlZddlmZgd¢Zej d¡edƒej dddd d dd œd d „ƒƒƒZ edƒej dddddd„ƒƒZ edƒej ddddd„ƒƒZ dS)zSwap edges in a graph.éN)Úpy_random_state)Údouble_edge_swapÚconnected_double_edge_swapÚdirected_edge_swapÚ undirectedéT)Ú mutates_inputÚ returns_graphééd)ÚnswapÚ max_triesÚseedcCsÊ||kr t d¡‚t|ƒdkrt d¡‚t|jƒdkr t d¡‚d}d}t| ¡Ž\}}tj |¡}tjj} ||krã| d||dd} || } |d7}||kr]d |›d |›d } t  | ¡‚|  | ¡dkreq6|  t |j | ƒ¡} | | krtq6|  | ¡dkr|q6|  t |j | ƒ¡}| |kr‹q6|  |¡dkr“q6|  t |j |ƒ¡}||kr¢q6||j | vrß||j | vrß| |j |vrß| | |¡| || ¡| | |¡| | | ¡| | |¡| ||¡|d7}||ks:|S) u#Swap three edges in a directed graph while keeping the node degrees fixed. A directed edge swap swaps three edges such that a -> b -> c -> d becomes a -> c -> b -> d. This pattern of swapping allows all possible states with the same in- and out-degree distribution in a directed graph to be reached. If the swap would create parallel edges (e.g. if a -> c already existed in the previous example), another attempt is made to find a suitable trio of edges. Parameters ---------- G : DiGraph A directed graph nswap : integer (optional, default=1) Number of three-edge (directed) swaps to perform max_tries : integer (optional, default=100) Maximum number of attempts to swap edges seed : integer, random_state, or None (default) Indicator of random number generation state. See :ref:`Randomness`. Returns ------- G : DiGraph The graph after the edges are swapped. Raises ------ NetworkXError If `G` is not directed, or If nswap > max_tries, or If there are fewer than 4 nodes or 3 edges in `G`. NetworkXAlgorithmError If the number of swap attempts exceeds `max_tries` before `nswap` swaps are made Notes ----- Does not enforce any connectivity constraints. The graph G is modified in place. A later swap is allowed to undo a previous swap. References ---------- .. [1] ErdÅ‘s, Péter L., et al. “A Simple Havel-Hakimi Type Algorithm to Realize Graphical Degree Sequences of Directed Graphs.†ArXiv:0905.4913 [Math], Jan. 2010. https://doi.org/10.48550/arXiv.0905.4913. Published 2010 in Elec. J. Combinatorics (17(1)). R66. http://www.combinatorics.org/Volume_17/PDF/v17i1r66.pdf .. [2] “Combinatorics - Reaching All Possible Simple Directed Graphs with a given Degree Sequence with 2-Edge Swaps.†Mathematics Stack Exchange, https://math.stackexchange.com/questions/22272/. Accessed 30 May 2022. ú*Number of swaps > number of tries allowed.éz"DiGraph has fewer than four nodes.rzDiGraph has fewer than 3 edgesrr ©Ú cdistributionrú!Maximum number of swap attempts (ú*) exceeded before desired swaps achieved (ú).)ÚnxÚ NetworkXErrorÚlenÚedgesÚzipÚdegreeÚutilsÚcumulative_distributionÚdiscrete_sequenceÚNetworkXAlgorithmErrorÚ out_degreeÚchoiceÚlistÚsuccÚadd_edgeÚ remove_edge)ÚGr r rÚtriesÚ swapcountÚkeysÚdegreesÚcdfrÚ start_indexÚstartÚmsgÚsecondÚthirdÚfourth©r2úl/var/www/html/construction_image-detection-poc/venv/lib/python3.10/site-packages/networkx/algorithms/swap.pyr sZ=            ×+rcCsh| ¡r t d¡‚||krt d¡‚t|ƒdkrt d¡‚t|jƒdkr)t d¡‚d}d}t| ¡Ž\}}tj |¡}tjj } ||kr²| d||d\} } | | krQq?|| } || } |  t || ƒ¡}|  t || ƒ¡}||krpq?| || vr˜|||vr˜|  | | ¡|  ||¡|  | |¡|  | |¡|d 7}||krªd |›d |›d }t |¡‚|d 7}||ksC|S) añSwap two edges in the graph while keeping the node degrees fixed. A double-edge swap removes two randomly chosen edges u-v and x-y and creates the new edges u-x and v-y:: u--v u v becomes | | x--y x y If either the edge u-x or v-y already exist no swap is performed and another attempt is made to find a suitable edge pair. Parameters ---------- G : graph An undirected graph nswap : integer (optional, default=1) Number of double-edge swaps to perform max_tries : integer (optional) Maximum number of attempts to swap edges seed : integer, random_state, or None (default) Indicator of random number generation state. See :ref:`Randomness`. Returns ------- G : graph The graph after double edge swaps. Raises ------ NetworkXError If `G` is directed, or If `nswap` > `max_tries`, or If there are fewer than 4 nodes or 2 edges in `G`. NetworkXAlgorithmError If the number of swap attempts exceeds `max_tries` before `nswap` swaps are made Notes ----- Does not enforce any connectivity constraints. The graph G is modified in place. zSdouble_edge_swap() not defined for directed graphs. Use directed_edge_swap instead.rrú Graph has fewer than four nodes.ézGraph has fewer than 2 edgesrrr rrr)Ú is_directedrrrrrrrrrr!r"r$r%r)r&r r rÚnr(r)r*r+rÚuiÚxiÚuÚxÚvÚyÚer2r2r3r†sP2ÿ         ÿÿ ær)rcCslt |¡s t d¡‚t|ƒdkrt d¡‚d}d}| ¡}dd„| ¡Dƒ}tj dd„| ¡Dƒ¡}tjj} d} ||kr´d} g} | |krõd } | | kræ||kræ| d ||d \}}||kr^qH||}||}| t |  |¡ƒ¡}| t |  |¡ƒ¡}||krqH|||vr°|||vr°|  ||¡|  ||¡|  ||¡|  ||¡|   ||||f¡|d7}|d7}t |||¡rÀ| d7} n|  ||¡|  ||¡|  ||¡|  ||¡|d8}d } | | kræ||ksP| rðt | d ¡} nÀ| d7} n»| | krt||krt| d ||d \}}||krqõ||}||}| t |  |¡ƒ¡}| t |  |¡ƒ¡}||kr0qõ|||vrc|||vrc|  ||¡|  ||¡|  ||¡|  ||¡|   ||||f¡|d7}|d7}| d7} | | krt||ksÿt |¡r| d7} n1| r©|  ¡\}}}}|  ||¡|  ||¡|  ||¡|  ||¡|d8}| s‚t | d ¡} ||ks>|S) a¥Attempts the specified number of double-edge swaps in the graph `G`. A double-edge swap removes two randomly chosen edges `(u, v)` and `(x, y)` and creates the new edges `(u, x)` and `(v, y)`:: u--v u v becomes | | x--y x y If either `(u, x)` or `(v, y)` already exist, then no swap is performed so the actual number of swapped edges is always *at most* `nswap`. Parameters ---------- G : graph An undirected graph nswap : integer (optional, default=1) Number of double-edge swaps to perform _window_threshold : integer The window size below which connectedness of the graph will be checked after each swap. The "window" in this function is a dynamically updated integer that represents the number of swap attempts to make before checking if the graph remains connected. It is an optimization used to decrease the running time of the algorithm in exchange for increased complexity of implementation. If the window size is below this threshold, then the algorithm checks after each swap if the graph remains connected by checking if there is a path joining the two nodes whose edge was just removed. If the window size is above this threshold, then the algorithm performs do all the swaps in the window and only then check if the graph is still connected. seed : integer, random_state, or None (default) Indicator of random number generation state. See :ref:`Randomness`. Returns ------- int The number of successful swaps Raises ------ NetworkXError If the input graph is not connected, or if the graph has fewer than four nodes. Notes ----- The initial graph `G` must be connected, and the resulting graph is connected. The graph `G` is modified in place. References ---------- .. [1] C. Gkantsidis and M. Mihail and E. Zegura, The Markov chain simulation method for generating connected power law random graphs, 2003. http://citeseer.ist.psu.edu/gkantsidis03markov.html zGraph not connectedrr4rcSsg|]\}}|‘qSr2r2©Ú.0r7Údr2r2r3Ú 6óz.connected_double_edge_swap..cSsg|]\}}|‘qSr2r2r?r2r2r3rB7rCr Fr5rT)rÚ is_connectedrrrrrrr!r"Ú neighborsr%r$ÚappendÚhas_pathÚmathÚceilÚpop)r&r Ú_window_thresholdrr7r(ÚdegÚdkr+rÚwindowÚwcountÚswappedÚfailr8r9r:r;r<r=r2r2r3rèsž F             Þ$       è      ú¥\r)r r N)r rN) Ú__doc__rHÚnetworkxrÚnetworkx.utilsrÚ__all__rÚnot_implemented_forÚ _dispatchablerrrr2r2r2r3Ús   x `