\Mh7dZddlmZddlZddlmZmZmZdgZ ededej d d efd Z dS) z% Stoer-Wagner minimum cut algorithm. )isliceN) BinaryHeaparbitrary_elementnot_implemented_for stoer_wagnerdirected multigraphweight) edge_attrsc t|}|dkrtjdtj|stjdtjfd|dD}d|_|dD]&\}}}|dd krtjd 'td }t|}g} t|d z D]} t|}|h} |} || D]"\}}| ||d #t|| z dz D]} | d }| ||| D]<\}}|| vr3| || |d |dz =| \}}| }||kr|}| }| ||f|| D]V\}}||krK|||vr||||d 4|||dxx|dz cc<W||tjt)| |}| |d }||ttj||}t/|t/||z f}||fS)a Returns the weighted minimum edge cut using the Stoer-Wagner algorithm. Determine the minimum edge cut of a connected graph using the Stoer-Wagner algorithm. In weighted cases, all weights must be nonnegative. The running time of the algorithm depends on the type of heaps used: ============== ============================================= Type of heap Running time ============== ============================================= Binary heap $O(n (m + n) \log n)$ Fibonacci heap $O(nm + n^2 \log n)$ Pairing heap $O(2^{2 \sqrt{\log \log n}} nm + n^2 \log n)$ ============== ============================================= Parameters ---------- G : NetworkX graph Edges of the graph are expected to have an attribute named by the weight parameter below. If this attribute is not present, the edge is considered to have unit weight. weight : string Name of the weight attribute of the edges. If the attribute is not present, unit weight is assumed. Default value: 'weight'. heap : class Type of heap to be used in the algorithm. It should be a subclass of :class:`MinHeap` or implement a compatible interface. If a stock heap implementation is to be used, :class:`BinaryHeap` is recommended over :class:`PairingHeap` for Python implementations without optimized attribute accesses (e.g., CPython) despite a slower asymptotic running time. For Python implementations with optimized attribute accesses (e.g., PyPy), :class:`PairingHeap` provides better performance. Default value: :class:`BinaryHeap`. Returns ------- cut_value : integer or float The sum of weights of edges in a minimum cut. partition : pair of node lists A partitioning of the nodes that defines a minimum cut. Raises ------ NetworkXNotImplemented If the graph is directed or a multigraph. NetworkXError If the graph has less than two nodes, is not connected or has a negative-weighted edge. Examples -------- >>> G = nx.Graph() >>> G.add_edge("x", "a", weight=3) >>> G.add_edge("x", "b", weight=1) >>> G.add_edge("a", "c", weight=3) >>> G.add_edge("b", "c", weight=5) >>> G.add_edge("b", "d", weight=4) >>> G.add_edge("d", "e", weight=2) >>> G.add_edge("c", "y", weight=2) >>> G.add_edge("e", "y", weight=3) >>> cut_value, partition = nx.stoer_wagner(G) >>> cut_value 4 zgraph has less than two nodes.zgraph is not connected.c3bK|])\}}}||k ||d|difV*dS)r N)get).0uver s l/var/www/html/test/jupyter/venv/lib/python3.11/site-packages/networkx/algorithms/connectivity/stoerwagner.py zstoer_wagner.._sX18AqRSWXRXRXA!%%**+,RXRXRXRXT)dataNr rz#graph has a negative-weighted edge.infr)r )lennx NetworkXError is_connectedGraphedges__networkx_cache__floatsetrangeritemsinsertpopaddrminappendadd_edge remove_noderadd_node"single_source_shortest_path_lengthlist)Gr heapnrrr cut_valuenodes contractionsiAhjw best_phase reachable partitions ` rrrsgT AA1uu?@@@ ?1  :8999 <=GGGrEsGGGGGGGGGG  Z  \""X&&&#*G G G '&#"! G G G r