VhCE ddlZddlmZddlZddlZddlmZmZejdZ e jgdgdgdgdgd gd gd gd gd g e Z e je je jdze Ze ede jdde jdf<e ee jdde jddf<dZdZgdZgdZgdZgdZgdZgdZd;dZdDD b  Dr?A Hr )rrrrrr rr rr r r+rr )r+r r.rr0r ))r r.rr.r r.r0r r0r2r0rrr2rr+r4r+rr2)r6)r2r+ r9r+r.r0r3r7rr r+))rrrr7r8r<r9r;r5r6)r r.rr.rr r/r1r)r*r+rr r-)r1r2r.rr>r)r*r,r?r-ctj}|D]7\}}}|j||||s|j|dz|dz|9|S)Nweightr:)rDiGraphadd_edge)edgesdoubleruvrCs rbuild_branchingrJsX A4 1f 1a '  JJq1ua!eFJ 34 Hr c |jdDcgc]\}}}|||j||f}}}}t|d}|Scc}}}w)NTdatac|d|d|dfS)Nrrr)xs rzsorted_edges..s1qtQqT(:r )key)rFgetsorted)rattrdefaultrHrIrMrFs r sorted_edgesrWsSABdAS T T!QaDHHT7+ , TE T 5: ;E L Us A cdt|jd}t|jd}t|t|k(sJt|||}t|||}t ||D]8\}} |dd| ddk(sJt j j|d| d:y)NTrLr)listrFlenrWzipr$testingassert_almost_equal) rr'rUrVedges1edges2e1e2abs rassert_equal_branchingsrds "(((% &F "(((% &F v;#f+ %% % b$ (B b$ (BB 31!u"1~~ &&qtQqT23r ctt}tj|sJdt j |dk(sJy)NT)rJoptimal_arborescence_1ris_arborescencerbranching_weightrs rtest_optimal_branching1rjs?./A  & &q )/4/ )  & &q )S 00 0r ctt}tj|sJdt j |dk(sJyNT5)rJoptimal_branching_2arrhrrirs rtest_optimal_branching2aro?,-A  & &q )/4/ )  & &q )R // /r ctt}tj|sJdt j |dk(sJyrl)rJoptimal_branching_2brrhrrirs rtest_optimal_branching2brsrpr ctt}tj|sJdt j |dk(sJy)NT3)rJoptimal_arborescence_2rrhrrirs rtest_optimal_arborescence2rws?./A  & &q )/4/ )  & &q )R // /r ctt}tj|sJdt j |dk(sJy)NT)rJgreedy_subopt_branching_1arrhrrirs r"test_greedy_suboptimal_branching1ar{?23A  & &q )/4/ )  & &q )S 00 0r ctt}tj|sJdt j |dk(sJy)NT)rJgreedy_subopt_branching_1brrhrrirs r"test_greedy_suboptimal_branching1brr|r cxt}tj|}tt}t ||yN)rrgreedy_branchingrJrrd)rBB_s rtest_greedy_max1rs2 A##A&A 3 4BAr"r ct}tjtjd5t j |d}dddy#1swYyxYw)NzUnknown value for `kind`.)matchlolkind)rpytestraisesrNetworkXExceptionrr)rrs r test_greedy_branching_kwarg_kindrsE A r++3N O7  ' ' 6777s AAc tj}|jgd|jdDcgc]\}}}|||j ddf}}}}t j t5|jtdddddddtj|d jd}t|d d ddifd dddifdddd ifgk(sJycc}}}w#1swYZxYw)N))rr+r r)r+rbr)rrr TrLrCrrr)rRreversemaxrrr r+rbr) rrDadd_weighted_edges_fromrFrSrr TypeErrorsortrrrrY)rrHrIrMrFrs r*test_greedy_branching_for_unsortable_nodesrs AFG?@wwDw?Q R R|1daDHHXq) * RE R y !: z!Q*D 9:##AE288d8CA 7 XqM" C(A A!}   S::s C,;C33C<ct}|dddd=tj|d}gd}t|}t ||y)NrrrCr.rV))rrr.r,r@r)r-r1r*r>rrrrJrdrrrFrs rtest_greedy_max2rsN A !Q 8##Aq1A E  BAr"r ct}tj|d}gd}t|}t ||dy)N)rU))rrr)r+rr)r+rr)r r0r)r.rr)r2r+r)r2r.r)r0r2rrrrrs rtest_greedy_max3rs< A##AD1A E  BAr1-r c|t}tj|d}gd}t|}t ||y)Nminr)rrrr(rrrrr rrr2rr r0rr=)r2r+rrrs rtest_greedy_minrs8 A##AE2A E  BAr"r cxt}tj|}tt}t ||yr)rrmaximum_branchingrJrgrdrrPx_s rtest_edmonds1_maxbranchr"s. A$$Q'A / 0BAr"r cxt}tj|}tt}t ||yr)rrmaximum_spanning_arborescencerJrgrdrs rtest_edmonds1_maxarborr). A003A / 0BAr"r ctjttj}t j |}gd}t |d}t||y)Nrr?r(rrrrr=r)T)rG)rr G_big_arrayrDrminimal_branchingrJrdrs rtest_edmonds1_minimal_branchingr0sG KbjjAA$$Q'A E t ,BAr"r cxt}tj|}tt}t ||yr)r'rrrJrnrdrs rtest_edmonds2_maxbranchrBs. A$$Q'A - .BAr"r cxt}tj|}tt}t ||yr)r'rrrJrvrdrs rtest_edmonds2_maxarborrIrr cxt}tj|}gd}t|}t ||y)Nr)rrminimum_spanning_arborescencerJrdrrPrFrs rtest_edmonds2_minarborrPs6 A003A E  BAr"r ctt}tj|}g}t|}t ||yr)rrminimum_branchingrJrdrs rtest_edmonds3_minbranch1rcs2 A$$Q'A E  BAr"r ct}|jdddtj|}dg}t |}t ||y)Nr0r:rB)r0r:r)rrErrrJrdrs rtest_edmonds3_minbranch2rksF AJJq!CJ $$Q'A ME  BAr"r c tj}dddgfdddgfdddgfdddgfdd dgfdd d gfdd d gfdd dgfd d dgfd d dgfd d dgfg }|j||j}t j |}ddhdfddhd fdd hd fdd hdfd dhd fd d hdfg}|j t|k(sJ|jdD]\}}}||h|df|vrJy)Nrr+rCr r)rCr2)rCr:r)rCr0r)rCrr rCr.r.)rCr4r2r:TrLrC) rGraphadd_edges_from to_directedrrnumber_of_edgesrZrF)redgelistrPrFrHrIds rtest_mstrwsj  A A  A  A  A  A  A A  A  A  A  A  HX A003A Q Q Q Q Q Q  E   #e* ,, ,777%.1aA( $---.r ctj}dddgfdddgfg}|j||j}t j |}y)Nrr+r1)rrrrrr)rrrPs rtest_mixed_nodetypesrsR  AA '!S=/)BCHX A003Ar cTtDcgc] \}}}||| f}}}}tjt tj}t j |}tg}t||t j|}t|}t||ycc}}}wr) rgrrrrDrrrJrdr)rHrIwrFrrPrs rtest_edmonds1_minbranchrs*@ @ @IQ1aQBZ @E @ WH2::>A $$Q'A  BAr" $$Q'A  BAr" AsB#ctj}ddgdfddgdfddgdfg}|j|tj|d}|ddd dk(sJ|ddd d k(sJy Nrrr) otherattrr) otherattr2r+rr)rr)rrr)rr+)rrTpreserve_attrsrrr+)rrrrrrrrs r-test_edge_attribute_preservation_normal_graphrs  A ACD ACD ACDH X$$Qt)rN) rrrrD EdgePartitionEXCLUDEDINCLUDEDrrrdrJ)r actual_edgesrs r$test_partition_spanning_arborescencers G"**=A++44AaDGK++44AaDGK++44AaDGK++44AaDGK++44AaDGK L 00kJAOL91=r ctjttj}d}tj }t j|D]"}|dz }|jd}||k\sJ|}$|dk(sJy)a Tests the arborescence iterator. A brute force method found 680 arborescences in this graph. This test will not verify all of them individually, but will check two things * The iterator returns 680 arborescences * The weight of the arborescences is non-strictly increasing for more information please visit https://mjschwenne.github.io/2021/06/10/implementing-the-iterators.html rrrrCrBN rrrrDmathinfrArborescenceIteratorsizerarborescence_countarborescence_weightrnew_arborescence_weights rtest_arborescence_iterator_minrs G"**=A88)  , ,Q /6a"#&&&"9&*====5 6  $$ $r ctjttj}d}tj }t j|dD]"}|dz }|jd}||ksJ|}$|dk(sJy ) a Tests the arborescence iterator. A brute force method found 680 arborescences in this graph. This test will not verify all of them individually, but will check two things * The iterator returns 680 arborescences * The weight of the arborescences is non-strictly decreasing for more information please visit https://mjschwenne.github.io/2021/06/10/implementing-the-iterators.html rrF)minimumrrCrBrNrrs rtest_arborescence_iterator_maxr!s G"**=A((  , ,Q >6a"#&&&"9&*====5 6  $$ $r crtjttj}gd}gd}d}tj }t j|||fD]P}|dz }|jd}||k\sJ|}|D]}||jvrJ|D]}||jvrJR|d k(sJy ) a$ Tests the arborescence iterator with three included edges and three excluded in the initial partition. A brute force method similar to the one used in the above tests found that there are 16 arborescences which contain the included edges and not the excluded edges. r))rr)r r.)r0r2))rr)r+r.)rr r)init_partitionrrCrBN) rrrrDrrrrrrF)rincluded_edgesexcluded_edgesrrrres r,test_arborescence_iterator_initial_partitionr<s G"**=A-N-N88)  , , >>: $ a"#&&&"9&*====5 A< <  $AAGG# ## $ $  ## #r c<tjdddd}td|jdDsJdtj|j tj |j tj|j tj|j tjjj|j tjjj|j tjjj|j td |jdDsJd y ) z| Tests that various branching algorithms work on graphs without weights. For more information, see issue #7279. r"g?T{)pdirectedseedc3,K|] \}}}d|vywrCNrO.0rHrIrs r z7test_branchings_with_default_weights..`IYaAxq IrLz-test is for graphs without a weight attributec3,K|] \}}}d|vywr rOr s rr z7test_branchings_with_default_weights..nr rzrs  <V! ((! "! !!!     hhrxx .2#h> 4; W]]1  0 a 00 014; GMM!  w}}Q/0 01    *     3"1 0 0 0 1 1 #7 #,.*#$###$###&## .F4#$&$)$#$>6%6%6$:r