o 3ήc<@s,ddlZddlZddlZddlZddlmZddlm Z m Z m Z m Z m Z ddlmZdZddZdd Zd d Zd d ZddZddZddZddZddZddZddZddZddZd d!Zd"d#Zd$d%Z d&d'Z!d(d)Z"d*d+Z#d,d-Z$d.d/Z%d9d0d1Z& d:d3d4Z'd;d5d6Z(d7d8Z)dS)<N)k_edge_augmentation)_unpack_available_edgescollapsecomplement_edgesis_k_edge_connectedis_locally_k_edge_connectedpairwisecCs2gd}gd}ttjdd||D}|S)N))r r r )r) r)r)  rr))r r)r r)r rcss|]}t|VqdSNr).0pathrd/tmp/pip-target-vg8gfxp4/lib/python/networkx/algorithms/connectivity/tests/test_edge_augmentation.py $z&tarjan_bridge_graph..)nxGraphitchain)ccsbridgesGrrr tarjan_bridge_graphsr*cst}|gd|gdddh}tdttt||}fdd|D}t |dd t |d|d t |d|d d t ||d d dS)N) r r r r rrrrr))r r)r r r r )r r)r rrcs"g|] \}}||difqS)costrandomruvrngrr /s"z#test_weight_key..r kr6availr,)r6r8weightr9) r#r$add_nodes_fromadd_edges_fromr.Randomlistsetr_augment_and_check_check_augmentations)r) impossibleavail_uvr8rr2r test_weight_key(s  rDcCsJtjtjttddtjtjttddtjtttdddS)Nrr5) pytestraisesr#NetworkXNotImplementedrDiGraph MultiGraph ValueErrorr$rrrr +test_is_locally_k_edge_connected_exceptions8srKcCstdd}t|ddsJt|ddrJt}|ddgt|ddr)Jt|ddr1Jtd}t|dds>Jt|ddsFJt|ddsNJt|d dsVJdS) Nrrr r5r rrr r )r# barbell_graphrr$r;complete_graphr)rrr test_is_k_edge_connected>s  rOcCsVtjtjttddddtjtjttddddtjtttdddddS)Nr r rr5) rErFr#rGrrHrIrJr$rrrr #test_is_k_edge_connected_exceptionsOsrPcCsbtdd}t|ddddsJt|ddddrJt}|ddgt|ddddr/JdS)Nrrrrr r5r )r#rLrr$r;rNrrr test_is_locally_k_edge_connected^s rQcCst}t|tdddS)Nr max_k)r#r$rAMAX_EFFICIENT_KrNrrr test_null_graphhsrUcCs.tddD]}t|}t|tddqdSNr rr rR)ranger#rMrArTnr)rrr test_cliquesms rZcCs<tddD]}t|}||dt|tddqdSrV)rWr#rMadd_noderArTrXrrr test_clique_and_nodess  r\cCs&t}|dt|tdddS)Nr r rR)r#r$r[rArTrNrrr test_point_graphzs r]cCs"t}|gdt|dS)N)r r r r )r#r$r;rArNrrr test_edgeless_graphs r^cCs8t}tttt|ddtttt|dddS)Nr5r)r#r$rErFrJr>rrNrrr test_invalid_ksr`c Cst}ttjtt|dgdttjtt|dgdttjtt|ddgdtt|ddgdd}|dgks=Jt|gtddt|dgtdddS)Nr r7r )rrT)r6r8partial)r8rS) r*rErFr#NetworkXUnfeasibler>rrArT)r) aug_edgesrrr test_unfeasiblesrdcCstt}tt|ddd}td|t|dksJgd}tt||ddd}t|dks3Jt||dS) Nr r5r aug_edges = r ) )rr)rr)r r)rr)rr)r rr+)rr)rr)rr)r8r6r)r*r?r@printlenrA)r)rcr8rrr test_tarjans rhcCsRgd}|D] }tjd|dd}ttj||d}|t|t|qdS)N)iiiii)seedtriesrj)r#random_powerlaw_tree_sequencer$configuration_modelremove_edges_fromselfloop_edgesrA)seedsrjdeg_seqr)rrr test_configurations rscCs2dg}|D]}ddg}tj||d}t|qdS)Nr)rFg?)r(g333333?rl)r#random_shell_graphrA)rqrj constructorr)rrr test_shells  rxcCst}t|dSr)r#karate_club_graphrArNrrr test_karates rzcCs:td}t|td}t|td}t|dS)Nr rr)r# star_graphrArNrrr test_stars    r|cCsTtdd}t|tdd}t|tdd}t|tdd}t|dS)Nrrr r r )r#rLrArNrrr test_barbells     r}cCstgd}t|dS)N))Y )r~} )rr)ir)r#r$rArNrrr test_bridges rcs>tdtjdddd}fddt|D}t||dS)Nrg{Gzt?rlcs.i|]\}}dkr||fdqS)g?r r-r/r2rr s z)test_gnp_augmentation..)r.r=r#gnp_random_graphrrA)r)r8rr2r test_gnp_augmentations  rcsdurtfdd|DsJdttttt|}ttttt|}t|t|ks3Jdtdd|Dr@Jdtfdd|DrOJd dS) z0Checks that aug_edges are consistently formattedNc3s|]}|vVqdSrrre avail_dictrr r!s z._assert_solution_properties..z4when avail is specified aug-edges should be in availzedges should be uniquecss|] \}}||kVqdSrrr/rrr r!szshould be no self-edgesc3s |] \}}||VqdSr)has_edger/rNrr r! s z(aug edges and G.edges should be disjoint)allr?maptuplesortedr>rgany)r)rcr unique_augr)r)rr _assert_solution_propertiess    rFc s\|durzt|}Wn tjyd}Ynwi}zL|dur+ttt||dndz tj||||d}t|tr@Jdg} |D]} | | qDWntj yd} d|d<t | dkseJd|dur|| } | |ks{Jd | d |n+|dur| } | zt| }Wn tjyd}Ynw||ksJd ttj|||d|d }t ||d <durt|tt|ksJdn*t dkr| }||t|}|tt|}||ksJd|} Ynwd} t | }|durtfdd| D}n|}||d<||d<| }|| zt|}Wn tjy9d}Ynw||d<| sU||krU|d|ksUJd|d|d|ks`Jdt|| Wn3tyd|d<tdt|tdt|tdt| td|w|rtd|| rd} | |fS)zP Does one specific augmentation and checks for properties of the result Nrr:)r6r9r8zshould always return an iterT infeasiblez*should not generate anything if unfeasiblez=unconstrained cases are only unfeasible if |V| <= k. Got |V|=z and k=zWavail should only be unfeasible if using all edges does not achieve k-edge-connectivity)r6r9rar8n_partial_edgesz5unweighted partial solutions should be the complementz,adding more edges should not increase k-connFc3s|]}|VqdSrrrrrr r!dr"z%_augment_and_check.. total_weight num_edgesaug_kz"connectivity should increase to k=z or morez+augmenting should never reduce connectivityfailedzedges = znodes = rezinfo = )r#edge_connectivityNetworkXPointlessConceptdictziprr isinstancer>appendrbrgnumber_of_nodescopyr<keysr?rsumr Exceptionrfedgesnodes)r)r6r8r9verboseorig_k max_aug_kinfo generatorrcedgern_nodes G_aug_all partial_edgesH partial_conn full_connrrG_augrrrr r@s        7  r@c Cs&zt|}Wn tjyd}Ynw|dur=t||dd}|}||zt|}Wntjy<d}Ynw|d}|durLtd|}ddt|D} |rt dt d |t d | t d |t d |t d |t d|dD]} |rt dt d| |rt dt || ||d\} } |rt dt || | |||dd\} }|dur|rt dt || |||||d\}}| dur| dkr|d| dksJ| dkr|dkr|d| ddksJn |d| ddks Jt || qdS)zCHelper to check weighted/unweighted cases with multiple values of krNr:r r cSsi|]}|dqSr rrrrr rsz(_check_augmentations..z === CHECK_AUGMENTATION ===zG.number_of_nodes = zG.number_of_edges = zmax_k = z max_aug_k = z orig_k = z---------------z Checking k = zunweighted case)r6rrzweighted uniform case)r6r8rrrz weighted case)r6r8r9rrrrr r )r#rrrrr<rminrrfnumber_of_edgesrWr@$_check_unconstrained_bridge_property)r)r8rSr9rr all_aug_edgesrr avail_uniformr6 aug_edges1info1 aug_edges2info2 aug_edges3info3rrr rAs         rAc Csddl}ttj|}t||}tdd|D}tdd|D}||dkrB||d|}|d}||ksDJddSdS) NrcSg|] \}}|dkr|qSrrrrYdrrr r4z8_check_unconstrained_bridge_property..cSr)rrrrrr r4rr r rz8augmentation size is different from what theory predicts) mathr>r# connectivitybridge_componentsrrgdegreeceil) r)rr bridge_ccsCpq size_targetsize_augrrr rs  rr)NNFNN)NNNF)* itertoolsr%r.rEnetworkxr# networkx.algorithms.connectivityr2networkx.algorithms.connectivity.edge_augmentationrrrrrnetworkx.utilsr rTr*rDrKrOrPrQrUrZr\r]r^r`rdrhrsrxrzr|r}rrrr@rArrrrr sD        } V