wgdZddlZddlZddlmZmZddlZddl m Z m Z gdZ e de dejdZe de dejd Ze de dejdd Zejd d Ze de dejdd Ze de dejd!d ZdZd!dZeddZdZejdZejd"dZejdZejd dZdZejddZejdZdZe de de dejd#dZ y)$a Algorithms for finding k-edge-augmentations A k-edge-augmentation is a set of edges, that once added to a graph, ensures that the graph is k-edge-connected; i.e. the graph cannot be disconnected unless k or more edges are removed. Typically, the goal is to find the augmentation with minimum weight. In general, it is not guaranteed that a k-edge-augmentation exists. See Also -------- :mod:`edge_kcomponents` : algorithms for finding k-edge-connected components :mod:`connectivity` : algorithms for determining edge connectivity. N) defaultdict namedtuple)not_implemented_forpy_random_state)k_edge_augmentationis_k_edge_connectedis_locally_k_edge_connecteddirected multigraphcjdkrtd|jdzkrytfd|jDrydk(rt j |Sdk(r-t j |xrt j | St j|k\S)a^Tests to see if a graph is k-edge-connected. Is it impossible to disconnect the graph by removing fewer than k edges? If so, then G is k-edge-connected. Parameters ---------- G : NetworkX graph An undirected graph. k : integer edge connectivity to test for Returns ------- boolean True if G is k-edge-connected. See Also -------- :func:`is_locally_k_edge_connected` Examples -------- >>> G = nx.barbell_graph(10, 0) >>> nx.is_k_edge_connected(G, k=1) True >>> nx.is_k_edge_connected(G, k=2) False k must be positive, not Fc3.K|] \}}|kywN).0ndks w/home/mcse/projects/flask/flask-venv/lib/python3.12/site-packages/networkx/algorithms/connectivity/edge_augmentation.py z&is_k_edge_connected..As *tq!QU *scutoff) ValueErrornumber_of_nodesanydegreenx is_connected has_bridgesedge_connectivity)Grs `rrrsD 1u3A3788QU" *qxxz * * 6??1% % !V??1%?bnnQ.?*? ?''!49 9c|dkrtd||j||ks|j||kry|dk(rtj|||Stjj ||||}||k\S)aTests to see if an edge in a graph is locally k-edge-connected. Is it impossible to disconnect s and t by removing fewer than k edges? If so, then s and t are locally k-edge-connected in G. Parameters ---------- G : NetworkX graph An undirected graph. s : node Source node t : node Target node k : integer local edge connectivity for nodes s and t Returns ------- boolean True if s and t are locally k-edge-connected in G. See Also -------- :func:`is_k_edge_connected` Examples -------- >>> from networkx.algorithms.connectivity import is_locally_k_edge_connected >>> G = nx.barbell_graph(10, 0) >>> is_locally_k_edge_connected(G, 5, 15, k=1) True >>> is_locally_k_edge_connected(G, 5, 15, k=2) False >>> is_locally_k_edge_connected(G, 1, 5, k=2) True r rFr)rrrhas_path connectivitylocal_edge_connectivity)r#strlocalks rr r MsV 1u3A3788 xx{Q!((1+/ 6;;q!Q' '__<3, this problem is NP-hard and this uses a randomized algorithm that produces a feasible solution, but provides no guarantees on the solution weight. Examples -------- >>> # Unweighted cases >>> G = nx.path_graph((1, 2, 3, 4)) >>> G.add_node(5) >>> sorted(nx.k_edge_augmentation(G, k=1)) [(1, 5)] >>> sorted(nx.k_edge_augmentation(G, k=2)) [(1, 5), (5, 4)] >>> sorted(nx.k_edge_augmentation(G, k=3)) [(1, 4), (1, 5), (2, 5), (3, 5), (4, 5)] >>> complement = list(nx.k_edge_augmentation(G, k=5, partial=True)) >>> G.add_edges_from(complement) >>> nx.edge_connectivity(G) 4 >>> # Weighted cases >>> G = nx.path_graph((1, 2, 3, 4)) >>> G.add_node(5) >>> # avail can be a tuple with a dict >>> avail = [(1, 5, {"weight": 11}), (2, 5, {"weight": 10})] >>> sorted(nx.k_edge_augmentation(G, k=1, avail=avail, weight="weight")) [(2, 5)] >>> # or avail can be a 3-tuple with a real number >>> avail = [(1, 5, 11), (2, 5, 10), (4, 3, 1), (4, 5, 51)] >>> sorted(nx.k_edge_augmentation(G, k=2, avail=avail)) [(1, 5), (2, 5), (4, 5)] >>> # or avail can be a dict >>> avail = {(1, 5): 11, (2, 5): 10, (4, 3): 1, (4, 5): 51} >>> sorted(nx.k_edge_augmentation(G, k=2, avail=avail)) [(1, 5), (2, 5), (4, 5)] >>> # If augmentation is infeasible, then a partial solution can be found >>> avail = {(1, 5): 11} >>> sorted(nx.k_edge_augmentation(G, k=2, avail=avail, partial=True)) [(1, 5)] rz"k must be a positive integer, not r zimpossible to z! connect in graph with less than z nodesNzno available edgesavailweightpartialrr.r/)rr.r/seed)rr.r/) rrrNetworkXUnfeasiblelenrone_edge_augmentationbridge_augmentationgreedy_k_edge_augmentationlistcomplement_edgespartial_k_edge_augmentation)r#rr.r/r0msg aug_edgess rrrs<b% 6A!EF F    1q5 ("1#%Fq1ugVTC'', ,  3u:?))!Q/++,@AAI !V-vwI!V+AU6JI3QeFI  ?""  },Q/ 8% !  sGDCCCCDC7DDDDDDc #Kd}t|||\}}|j}|jdt||Dt t j ||}|D]} t| dkDs|j| j} | jdD cic]\} } } d| vr | d| d }} } } | j|jt j| || Ed {tj|d D]B\}}||||D]0\} } |j| | } | j!dd }|-|2Dy cc} } } w7iw) a.Finds augmentation that k-edge-connects as much of the graph as possible. When a k-edge-augmentation is not possible, we can still try to find a small set of edges that partially k-edge-connects as much of the graph as possible. All possible edges are generated between remaining parts. This minimizes the number of k-edge-connected subgraphs in the resulting graph and maximizes the edge connectivity between those subgraphs. Parameters ---------- G : NetworkX graph An undirected graph. k : integer Desired edge connectivity avail : dict or a set of 2 or 3 tuples For more details, see :func:`k_edge_augmentation`. weight : string key to use to find weights if ``avail`` is a set of 3-tuples. For more details, see :func:`k_edge_augmentation`. Yields ------ edge : tuple Edges in the partial augmentation of G. These edges k-edge-connect any part of G where it is possible, and maximally connects the remaining parts. In other words, all edges from avail are generated except for those within subgraphs that have already become k-edge-connected. Notes ----- Construct H that augments G with all edges in avail. Find the k-edge-subgraphs of H. For each k-edge-subgraph, if the number of nodes is more than k, then find the k-edge-augmentation of that graph and add it to the solution. Then add all edges in avail between k-edge subgraphs to the solution. See Also -------- :func:`k_edge_augmentation` Examples -------- >>> G = nx.path_graph((1, 2, 3, 4, 5, 6, 7)) >>> G.add_node(8) >>> avail = [(1, 3), (1, 4), (1, 5), (2, 4), (2, 5), (3, 5), (1, 8)] >>> sorted(partial_k_edge_augmentation(G, k=2, avail=avail)) [(1, 5), (1, 8)] c3K|Dcic]}|t|j|}}|jD]#\}}|j|}|D]}||f %ycc}ww)z"finds edges between disjoint nodesN)setadjitems intersection)Honly1only2u only1_adjneighbs neighbs12vs r_edges_between_disjointz._edges_between_disjointVsq/45!QAEE!H %5 5#//+ JAw,,U3I !f   6sA% A >A%r/r#c3<K|]\\}}}|||||fdfywr/ generatorNr)rrFrJws rrz.partial_k_edge_augmentation..ds0 Aaq!f5 6 srr TdatarPr/)rr.Nr)_unpack_available_edgescopyadd_edges_fromzipr8rk_edge_subgraphsr4subgraphedgesremove_edges_fromkeysrit combinations get_edge_dataget)r#rr.r/rKavail_uvavail_wrCrYnodesCrFrJr sub_availcc1cc2edges rr:r: sl0fJHg A  0  B//Q78"G u:> 5!&&(A"#d!3Q1!#+( +I     0 1--a1IF F FG"OO$4a8S+AsC8 DAq1%A55d+D   Gs+A:E4=5E42E+ >E4E2 AE4"E4c:| t|St||||S)a+Finds minimum weight set of edges to connect G. Equivalent to :func:`k_edge_augmentation` when k=1. Adding the resulting edges to G will make it 1-edge-connected. The solution is optimal for both weighted and non-weighted variants. Parameters ---------- G : NetworkX graph An undirected graph. avail : dict or a set of 2 or 3 tuples For more details, see :func:`k_edge_augmentation`. weight : string key to use to find weights if ``avail`` is a set of 3-tuples. For more details, see :func:`k_edge_augmentation`. partial : boolean If partial is True and no feasible k-edge-augmentation exists, then the augmenting edges minimize the number of connected components. Yields ------ edge : tuple Edges in the one-augmentation of G Raises ------ NetworkXUnfeasible If partial is False and no one-edge-augmentation exists. Notes ----- Uses either :func:`unconstrained_one_edge_augmentation` or :func:`weighted_one_edge_augmentation` depending on whether ``avail`` is specified. Both algorithms are based on finding a minimum spanning tree. As such both algorithms find optimal solutions and run in linear time. See Also -------- :func:`k_edge_augmentation` r-)#unconstrained_one_edge_augmentationweighted_one_edge_augmentation)r#r.r/r0s rr5r5s+^ }2155- U67  r$c|jdkrtjd| t|St |||S)aFinds the a set of edges that bridge connects G. Equivalent to :func:`k_edge_augmentation` when k=2, and partial=False. Adding the resulting edges to G will make it 2-edge-connected. If no constraints are specified the returned set of edges is minimum an optimal, otherwise the solution is approximated. Parameters ---------- G : NetworkX graph An undirected graph. avail : dict or a set of 2 or 3 tuples For more details, see :func:`k_edge_augmentation`. weight : string key to use to find weights if ``avail`` is a set of 3-tuples. For more details, see :func:`k_edge_augmentation`. Yields ------ edge : tuple Edges in the bridge-augmentation of G Raises ------ NetworkXUnfeasible If no bridge-augmentation exists. Notes ----- If there are no constraints the solution can be computed in linear time using :func:`unconstrained_bridge_augmentation`. Otherwise, the problem becomes NP-hard and is the solution is approximated by :func:`weighted_bridge_augmentation`. See Also -------- :func:`k_edge_augmentation` z.impossible to bridge connect less than 3 nodes)r/)rrr3!unconstrained_bridge_augmentationweighted_bridge_augmentation)r#r.r/s rr6r6sGX Q##$TUU }033+AuVDDr$c||kr||fS||fS)zAReturns the nodes in an undirected edge in lower-triangular orderr)rFrJs r_orderedrrsUAq6&A&r$cdt|tr3t|j}t|j }n?fd}|Dcgc]}|dd }}|Dcgc]}t |dk(rdn ||d}}|c|Dcgc]\}}|j || } }}ttj|| }ttj|| }||fScc}wcc}wcc}}w)z=Helper to separate avail into edges and corresponding weightsr/c2 |S#t$r|cYSwxYwr) TypeError)rr/s r _try_getitemz-_unpack_available_edges.._try_getitems& y   s  rrr ) isinstancedictr8r]valuesr4has_edger^compress) r.r/r#rbrcrvtuprFrJflagss ` rrUrUs ~% %u||~&  )..C!H..LQRSCA 1<B+@@RR}2:;$!QQZZ1%%;; He45r{{7E23 W /R>> # Each group represents a meta-node >>> groups = ([1, 2, 3], [4, 5], [6]) >>> mapping = {n: meta_n for meta_n, ns in enumerate(groups) for n in ns} >>> avail_uv = [(1, 2), (3, 6), (1, 4), (5, 2), (6, 1), (2, 6), (3, 1)] >>> avail_w = [20, 99, 20, 15, 50, 99, 20] >>> sorted(_lightest_meta_edges(mapping, avail_uv, avail_w)) [MetaEdge(meta_uv=(0, 1), uv=(5, 2), w=15), MetaEdge(meta_uv=(0, 2), uv=(6, 1), w=50)] N)rr8rXrrappendrAminr) mappingrbrc grouped_wuvrQrFrJrmumv choices_wuvs r_lightest_meta_edgesrsBd#K(+/ 6Aq71:wqz2G##Q1I. /"-!2!2!40R+ 8+&GAq!B8aVQ/ / 0s A.B1%Bc#Kttj|}t||}t|j }tt ||dd}t t}|jdjD]\}}||j||D]\}} ||d|| dfyw)asFinds the smallest set of edges to connect G. This is a variant of the unweighted MST problem. If G is not empty, a feasible solution always exists. Parameters ---------- G : NetworkX graph An undirected graph. Yields ------ edge : tuple Edges in the one-edge-augmentation of G See Also -------- :func:`one_edge_augmentation` :func:`k_edge_augmentation` Examples -------- >>> G = nx.Graph([(1, 2), (2, 3), (4, 5)]) >>> G.add_nodes_from([6, 7, 8]) >>> sorted(unconstrained_one_edge_augmentation(G)) [(1, 4), (4, 6), (6, 7), (7, 8)] r Nrr) r8rconnected_componentscollapserdrXrgraphrAr) r#ccs1re meta_nodesmeta_auginverserrJrrs rrkrkFs: ''* +DDAaggiJC JqrN34H$G "((*1 !/Br{1~wr{1~../sCCc#Kt|||\}}t|tj|}|jd}t |||}|j d|Dtj|} |s*tj| stjd| jdD]\} } } d| vs | d} | yw) aFinds the minimum weight set of edges to connect G if one exists. This is a variant of the weighted MST problem. Parameters ---------- G : NetworkX graph An undirected graph. avail : dict or a set of 2 or 3 tuples For more details, see :func:`k_edge_augmentation`. weight : string key to use to find weights if ``avail`` is a set of 3-tuples. For more details, see :func:`k_edge_augmentation`. partial : boolean If partial is True and no feasible k-edge-augmentation exists, then the augmenting edges minimize the number of connected components. Yields ------ edge : tuple Edges in the subset of avail chosen to connect G. See Also -------- :func:`one_edge_augmentation` :func:`k_edge_augmentation` Examples -------- >>> G = nx.Graph([(1, 2), (2, 3), (4, 5)]) >>> G.add_nodes_from([6, 7, 8]) >>> # any edge not in avail has an implicit weight of infinity >>> avail = [(1, 3), (1, 5), (4, 7), (4, 8), (6, 1), (8, 1), (8, 2)] >>> sorted(weighted_one_edge_augmentation(G, avail)) [(1, 5), (4, 7), (6, 1), (8, 1)] >>> # find another solution by giving large weights to edges in the >>> # previous solution (note some of the old edges must be used) >>> avail = [(1, 3), (1, 5, 99), (4, 7, 9), (6, 1, 99), (8, 1, 99), (8, 2)] >>> sorted(weighted_one_edge_augmentation(G, avail)) [(1, 5), (4, 7), (6, 1), (8, 2)] rLrc3:K|]\\}}}}||||dfywrNr)rrrrrQs rrz1weighted_one_edge_augmentation..s. HRb! RAB/0sz.Not possible to connect G with available edgesTrSrPN) rUrrrrrrWminimum_spanning_treer r3r[)r#r.r/r0rbrcrercandidate_mappingmeta_mstrrrris rrlrlqs\0fJHg B++A./Aggi G,WhH0 ''*H 2??84##$TUU^^^. B ! [>DJs CC Cc #Kttjj}t |}tj |Dcgc]8}t |dk(rt|dznt||jdd:}}t |dkDr=|Dcgc]}|d }}|Dcgc]}|d }}tt|dd|}ng}|j} | j|| jD cgc] \} } | dk(s | } } } t | dk(rg} t | dk(r t| g} n td| jD}tj| |D cgc]} | j| dk(s| }} t!j"t |dz }tt|d||| d} || z}t%t}|j&dj)D]\}}||j+||j)Dcic]\}}|t|fd}}}j}|D]U\}}t-j.||||D]1\}}|j1||r|j3||||fUWycc}wcc}wcc}wcc} } w#t$rYywxYwcc} wcc}}ww) a Finds an optimal 2-edge-augmentation of G using the fewest edges. This is an implementation of the algorithm detailed in [1]_. The basic idea is to construct a meta-graph of bridge-ccs, connect leaf nodes of the trees to connect the entire graph, and finally connect the leafs of the tree in dfs-preorder to bridge connect the entire graph. Parameters ---------- G : NetworkX graph An undirected graph. Yields ------ edge : tuple Edges in the bridge augmentation of G Notes ----- Input: a graph G. First find the bridge components of G and collapse each bridge-cc into a node of a metagraph graph C, which is guaranteed to be a forest of trees. C contains p "leafs" --- nodes with exactly one incident edge. C contains q "isolated nodes" --- nodes with no incident edges. Theorem: If p + q > 1, then at least :math:`ceil(p / 2) + q` edges are needed to bridge connect C. This algorithm achieves this min number. The method first adds enough edges to make G into a tree and then pairs leafs in a simple fashion. Let n be the number of trees in C. Let v(i) be an isolated vertex in the i-th tree if one exists, otherwise it is a pair of distinct leafs nodes in the i-th tree. Alternating edges from these sets (i.e. adding edges A1 = [(v(i)[0], v(i + 1)[1]), v(i + 1)[0], v(i + 2)[1])...]) connects C into a tree T. This tree has p' = p + 2q - 2(n -1) leafs and no isolated vertices. A1 has n - 1 edges. The next step finds ceil(p' / 2) edges to biconnect any tree with p' leafs. Convert T into an arborescence T' by picking an arbitrary root node with degree >= 2 and directing all edges away from the root. Note the implementation implicitly constructs T'. The leafs of T are the nodes with no existing edges in T'. Order the leafs of T' by DFS preorder. Then break this list in half and add the zipped pairs to A2. The set A = A1 + A2 is the minimum augmentation in the metagraph. To convert this to edges in the original graph References ---------- .. [1] Eswaran, Kapali P., and R. Endre Tarjan. (1975) Augmentation problems. http://epubs.siam.org/doi/abs/10.1137/0205044 See Also -------- :func:`bridge_augmentation` :func:`k_edge_augmentation` Examples -------- >>> G = nx.path_graph((1, 2, 3, 4, 5, 6, 7)) >>> sorted(unconstrained_bridge_augmentation(G)) [(1, 7)] >>> G = nx.path_graph((1, 2, 3, 2, 4, 5, 6, 7)) >>> sorted(unconstrained_bridge_augmentation(G)) [(1, 3), (3, 7)] >>> G = nx.Graph([(0, 1), (0, 2), (1, 2)]) >>> G.add_node(4) >>> sorted(unconstrained_bridge_augmentation(G)) [(1, 4), (4, 0)] r r)keyrNc32K|]\}}|dkDs |ywr Nrrrrs rrz4unconstrained_bridge_augmentation../s:daAE: rc*j||fSr)r)rFr#s rz3unconstrained_bridge_augmentation..Bs!((1+q)9r$)r8rr'bridge_componentsrrr4tuplesortedrrXrVrWnext StopIterationdfs_preorder_nodesmathceilrrrArr^productr{add_edge)r# bridge_ccsreccvset1vsnodes1nodes2A1TrrleafsA2rootv2halfaug_tree_edgesrrrJrmappedG2rrFs` rrorosrboo77:;JJA))!,    r7a< b A BAHH %a * + E   5zA~"'(B"Q%(("'(B"Q%(( #fQRj&) *  AR88: 041aaQ 0E 0 5zQ  5zQEl^ :ahhj::D..q$7 LA188A;!;Ka L LyyR1% #b$iTEF, -"WN$G "((*1 ! "--/ B F69 ::G B BJJwr{GBK8 DAq;;q!$ Aq!d   g )( 1   MsA K==K K= K,K=2 K>AK= KK!.K= K#0K=K2"K2&BK=K7 AK=03K=# K/,K=.K//K=c #K|d}tj|sC|j}tt |||}|j ||Ed{ng}|}t |dk(r*tj|rtjdt|||\}}tjj|}t||}|jd} t| ||D cic]\\} } } } | | f| | f}} } } } td|j!D}tj$||}tj&|j}tj(|dd tj*|||j- }|D]r\\} } }|| | f\} } || k(r|j/|| | | .|| k(r|j/|| | | I|j/|| | | |j/|| | | t t1||}t5}|j7D]2\} } |j9| | }d |vs|d }|j;|4|Ed{y7/cc} } } } w#t"$rYywxYw#tj2$r}tjd |d}~wwxYw7Pw)aFinds an approximate min-weight 2-edge-augmentation of G. This is an implementation of the approximation algorithm detailed in [1]_. It chooses a set of edges from avail to add to G that renders it 2-edge-connected if such a subset exists. This is done by finding a minimum spanning arborescence of a specially constructed metagraph. Parameters ---------- G : NetworkX graph An undirected graph. avail : set of 2 or 3 tuples. candidate edges (with optional weights) to choose from weight : string key to use to find weights if avail is a set of 3-tuples where the third item in each tuple is a dictionary. Yields ------ edge : tuple Edges in the subset of avail chosen to bridge augment G. Notes ----- Finding a weighted 2-edge-augmentation is NP-hard. Any edge not in ``avail`` is considered to have a weight of infinity. The approximation factor is 2 if ``G`` is connected and 3 if it is not. Runs in :math:`O(m + n log(n))` time References ---------- .. [1] Khuller, Samir, and Ramakrishna Thurimella. (1993) Approximation algorithms for graph augmentation. http://www.sciencedirect.com/science/article/pii/S0196677483710102 See Also -------- :func:`bridge_augmentation` :func:`k_edge_augmentation` Examples -------- >>> G = nx.path_graph((1, 2, 3, 4)) >>> # When the weights are equal, (1, 4) is the best >>> avail = [(1, 4, 1), (1, 3, 1), (2, 4, 1)] >>> sorted(weighted_bridge_augmentation(G, avail)) [(1, 4)] >>> # Giving (1, 4) a high weight makes the two edge solution the best. >>> avail = [(1, 4, 1000), (1, 3, 1), (2, 4, 1)] >>> sorted(weighted_bridge_augmentation(G, avail)) [(1, 3), (2, 4)] >>> # ------ >>> G = nx.path_graph((1, 2, 3, 4)) >>> G.add_node(5) >>> avail = [(1, 5, 11), (2, 5, 10), (4, 3, 1), (4, 5, 1)] >>> sorted(weighted_bridge_augmentation(G, avail=avail)) [(1, 5), (4, 5)] >>> avail = [(1, 5, 11), (2, 5, 10), (4, 3, 1), (4, 5, 51)] >>> sorted(weighted_bridge_augmentation(G, avail=avail)) [(1, 5), (2, 5), (4, 5)] Nr/r1rzno augmentation possiblerLrc32K|]\}}|dk(s |ywrrrs rrz/weighted_bridge_augmentation..s7$!QQA7rnamerz)rpairsrOzno 2-edge-augmentation possiblerP)rr rVr8r5rWr4r!r3rUr'rrrrrrrdfs_treereverseset_edge_attributes%tree_all_pairs_lowest_common_ancestorr]r_minimum_rooted_branchingNetworkXExceptionr?r[r`add)r#r.r/rC connectorsrbrcrrerrrrrQ meta_to_wuvrTRDlca_genlcaAerrbridge_connectorsrTris rrprpQsD~ ??1  FFH/vNO  $  5zQ >>! ''(BC C/fJHg2215JJAggi G 4GXwO HRb! R1b'K$7!((*77 Q B 2A18A666 [--/G! 8 R#RH%2 "9 JJsBqBJ 7 BY JJsBqBJ 7 JJsBqBJ 7 JJsBqBJ 7 8 P &a .'')(Br2& $  $D  ! !$ ' (!  { $( L   P##$EFCOP"!sAKJBK8J K J3C.K" J".6K%KKK K JKJK"K5K  KKc|j}|j|j|Dcgc]}||fc}tj|}|Scc}w)afHelper function to compute a minimum rooted branching (aka rooted arborescence) Before the branching can be computed, the directed graph must be rooted by removing the predecessors of root. A branching / arborescence of rooted graph G is a subgraph that contains a directed path from the root to every other vertex. It is the directed analog of the minimum spanning tree problem. References ---------- [1] Khuller, Samir (2002) Advanced Algorithms Lecture 24 Notes. https://web.archive.org/web/20121030033722/https://www.cs.umd.edu/class/spring2011/cmsc651/lec07.pdf )rVr\ predecessorsrminimum_spanning_arborescence)rrrootedrFrs rrrsP VVXF 1EFAq$iFG ((0A HGs AT) returns_graphc i i}|j}dt|j}t|D]X\}t|}|j |sJd|j |||< j fd|DZt|dzD]'\}|h}||< j fd|D)dz}|jt||j fd|jDtj|d|  |jd <|S) aCollapses each group of nodes into a single node. This is similar to condensation, but works on undirected graphs. Parameters ---------- G : NetworkX Graph grouped_nodes: list or generator Grouping of nodes to collapse. The grouping must be disjoint. If grouped_nodes are strongly_connected_components then this is equivalent to :func:`condensation`. Returns ------- C : NetworkX Graph The collapsed graph C of G with respect to the node grouping. The node labels are integers corresponding to the index of the component in the list of grouped_nodes. C has a graph attribute named 'mapping' with a dictionary mapping the original nodes to the nodes in C to which they belong. Each node in C also has a node attribute 'members' with the set of original nodes in G that form the group that the node in C represents. Examples -------- >>> # Collapses a graph using disjoint groups, but not necessarily connected >>> G = nx.Graph([(1, 0), (2, 3), (3, 1), (3, 4), (4, 5), (5, 6), (5, 7)]) >>> G.add_node("A") >>> grouped_nodes = [{0, 1, 2, 3}, {5, 6, 7}] >>> C = collapse(G, grouped_nodes) >>> members = nx.get_node_attributes(C, "members") >>> sorted(members.keys()) [0, 1, 2, 3] >>> member_values = set(map(frozenset, members.values())) >>> assert {0, 1, 2, 3} in member_values >>> assert {4} in member_values >>> assert {5, 6, 7} in member_values >>> assert {"A"} in member_values rz-grouped nodes must exist in G and be disjointc3&K|]}|f ywrrrris rrzcollapse..J-!1v-r )startc3&K|]}|f ywrrrs rrzcollapse..Orrc3PK|]\}}||k7s||fywrr)rrFrJrs rrzcollapse..Rs7%)Q'!*PQ :RWQZ s&&membersrr) __class__r?rd enumerate issupersetdifference_updateupdateadd_nodes_fromrangerWr[rset_node_attributesr) r# grouped_nodesrre remaininggroupnodenumber_of_groupsrrs @@rrrsHTGG A AAGGIIm,.5E ##   ; : ;  ##E* -u--.Ya!e4.4 -u--.1uU+,--.WWY19W= AGGI Hr$c#HK|j}|jrHtj|j dD] \}}|||vr||f|||vs||f"ytj|j dD]\}}|||vs||fyw)a/Returns only the edges in the complement of G Parameters ---------- G : NetworkX Graph Yields ------ edge : tuple Edges in the complement of G Examples -------- >>> G = nx.path_graph((1, 2, 3, 4)) >>> sorted(complement_edges(G)) [(1, 3), (1, 4), (2, 4)] >>> G = nx.path_graph((1, 2, 3, 4), nx.DiGraph()) >>> sorted(complement_edges(G)) [(1, 3), (1, 4), (2, 1), (2, 4), (3, 1), (3, 2), (4, 1), (4, 2), (4, 3)] >>> G = nx.complete_graph(1000) >>> sorted(complement_edges(G)) [] rN)_adj is_directedr^r_rd)r#G_adjrFrJs rr9r9\s2 FFE}}OOAGGIq1 DAqa !f a !f   OOAGGIq1 DAqa !f  sAB":B" B"c&|j|y)z=wrapper around rng.shuffle for python 2 compatibility reasonsN)shuffle)rnginputs r_compat_shufflersKKr$c #Kg}t||}|ry|$tt|}dgt|z}nt |||\}}|D cgc]!} t t |j| #} } tt|| |} | D cgc]\} } } |  }} } } |j}|D]s\}}d}t||||sY|j||f|j|||j||k\r |j||k\r t||}|ssn|stjdt!||t|D]\}}|j||ks|j||kr/|j#|||j%||ft||rb|j|||j||f|Ed{ycc} wcc} } } w7w)aQGreedy algorithm for finding a k-edge-augmentation Parameters ---------- G : NetworkX graph An undirected graph. k : integer Desired edge connectivity avail : dict or a set of 2 or 3 tuples For more details, see :func:`k_edge_augmentation`. weight : string key to use to find weights if ``avail`` is a set of 3-tuples. For more details, see :func:`k_edge_augmentation`. seed : integer, random_state, or None (default) Indicator of random number generation state. See :ref:`Randomness`. Yields ------ edge : tuple Edges in the greedy augmentation of G Notes ----- The algorithm is simple. Edges are incrementally added between parts of the graph that are not yet locally k-edge-connected. Then edges are from the augmenting set are pruned as long as local-edge-connectivity is not broken. This algorithm is greedy and does not provide optimality guarantees. It exists only to provide :func:`k_edge_augmentation` with the ability to generate a feasible solution for arbitrary k. See Also -------- :func:`k_edge_augmentation` Examples -------- >>> G = nx.path_graph((1, 2, 3, 4, 5, 6, 7)) >>> sorted(greedy_k_edge_augmentation(G, k=2)) [(1, 7)] >>> sorted(greedy_k_edge_augmentation(G, k=1, avail=[])) [] >>> G = nx.path_graph((1, 2, 3, 4, 5, 6, 7)) >>> avail = {(u, v): 1 for (u, v) in complement_edges(G)} >>> # randomized pruning process can produce different solutions >>> sorted(greedy_k_edge_augmentation(G, k=4, avail=avail, seed=2)) [(1, 3), (1, 4), (1, 5), (1, 6), (1, 7), (2, 4), (2, 6), (3, 7), (5, 7)] >>> sorted(greedy_k_edge_augmentation(G, k=4, avail=avail, seed=3)) [(1, 3), (1, 5), (1, 6), (2, 4), (2, 6), (3, 7), (4, 7), (5, 7)] Nr rLFrRz/not able to k-edge-connect with available edges)rr8r9r4rUsummaprrrXrVr rrrr3r remove_edgeremove)r#rr.r/r2r<donerbrcr tiebreaker avail_wduvrQrrCrFrJs rr7r7szI q! $D  }(+,#H %4E&AN'4<rsg  /? WZ \"-:#!-:`Z \"4#!4nZ \"S#!SlaaH\"Z 1 !#1 h\"Z .E!#.Eh' 4 j"8 9.0b'/'/TAAHWWtg!g!T 0%D &D N""J \"Z k!#kr$