o 3ήcS@sdZddlZddlZddlmZmZddZGdddZGdd d eZ Gd d d eZ Gd d d e Z Gddde Z GdddZ ddZejjddZddZejjddZdS)z>Unit tests for the :mod:`networkx.algorithms.tree.mst` module.N) edges_equal nodes_equalcCsBtttjtddWddS1swYdS)Nrandom algorithm)pytestraises ValueErrornxminimum_spanning_treeGraphr r N/tmp/pip-target-vg8gfxp4/lib/python/networkx/algorithms/tree/tests/test_mst.pytest_unknown_algorithm s "rc@sxeZdZdZddZddZddZdd Zd d Zd d Z ddZ ddZ ddZ ddZ ddZddZddZdS)MinimumSpanningTreeTestBaseaBase class for test classes for minimum spanning tree algorithms. This class contains some common tests that will be inherited by subclasses. Each subclass must have a class attribute :data:`algorithm` that is a string representing the algorithm to run, as described under the ``algorithm`` keyword argument for the :func:`networkx.minimum_spanning_edges` function. Subclasses can then implement any algorithm-specific tests. c Cs|j|_gd}t|_|j|ddddifddddifddddifd dddifdddd ifdd dd ifg|_ddddifdd dd ifdddd ifdddd ifdd dd ifdd ddifg|_dS)zjCreates an example graph and stores the expected minimum and maximum spanning tree edges. )r)r)r)rr )rr)rrr)rr)rr)rrr)rrr)rr rrweightrrrrrrrrrrN)ralgor r Gadd_weighted_edges_fromminimum_spanning_edgelistmaximum_spanning_edgelist)selfmethodedgesr r r setup_methods$             z(MinimumSpanningTreeTestBase.setup_methodcC8tj|j|jd}tdd|D}t||jsJdS)Nrcs,|]\}}}t||t|||fVqdSNminmax.0uvdr r r D*zAMinimumSpanningTreeTestBase.test_minimum_edges..)r minimum_spanning_edgesrrsortedrr!r#r%actualr r rtest_minimum_edges@z.MinimumSpanningTreeTestBase.test_minimum_edgescCr')Nrcsr(r)r*r-r r rr2Kr3zAMinimumSpanningTreeTestBase.test_maximum_edges..)r maximum_spanning_edgesrrr5rr"r6r r rtest_maximum_edgesGr9z.MinimumSpanningTreeTestBase.test_maximum_edgescCsHtj|j|jdd}tdd|D}dd|jD}t||s"JdS)NFrdatacs(|]\}}t||t||fVqdSr)r*r.r/r0r r rr2R&z@MinimumSpanningTreeTestBase.test_without_data..cSg|] \}}}||fqSr r r-r r r SzAMinimumSpanningTreeTestBase.test_without_data..)r r4rrr5r!r)r#r%r7expectedr r rtest_without_dataNsz-MinimumSpanningTreeTestBase.test_without_datacCs|j}|jddtddtj||jddd}tdd |D}d d |jD}t||s/Jtj||jddd}t t  t |Wdn1sMwYtj||jdd }t t  t |WddS1spwYdS) Nr nanrFTrr= ignore_nancsr>r)r*r?r r rr2]r@z?MinimumSpanningTreeTestBase.test_nan_weights..cSrAr r r-r r rrB^rCz@MinimumSpanningTreeTestBase.test_nan_weights..r<) radd_edgefloatr r4rr5r!rrrr list)r#rr%r7rDr r rtest_nan_weightsVs$      "z,MinimumSpanningTreeTestBase.test_nan_weightscCsgd}t}|dd|D|jddtddtj||jdd d }td d |D}d d|jD}t ||s>JdS)NrcS$g|]\}}}|d|d|fqSrr r.r/r0wtr r rrB{$zFMinimumSpanningTreeTestBase.test_nan_weights_order..rrrGrHFTrIcsr>r)r*r?r r rr2r@zEMinimumSpanningTreeTestBase.test_nan_weights_order..cS"g|] \}}}|d|dfqSrPr r-r r rrB") r r r rKrLr4rr5r!rr#r%rr7shiftr r rtest_nan_weights_orderks  z2MinimumSpanningTreeTestBase.test_nan_weights_ordercCsvgd}t}|dd|D|dtj||jddd}tdd |D}d d|jD}t||s9JdS) NrcSrOrPr rQr r rrBrSzBMinimumSpanningTreeTestBase.test_isolated_node..rFTrIcsr>r)r*r?r r rr2r@zAMinimumSpanningTreeTestBase.test_isolated_node..cSrTrPr r-r r rrBrU) r r r add_noder4rr5r!rrVr r rtest_isolated_nodes   z.MinimumSpanningTreeTestBase.test_isolated_nodecC6tj|j|jd}t|jdd}t||jsJdSNrTr=)r r rrr5r%rr!r#Tr7r r rtest_minimum_treez-MinimumSpanningTreeTestBase.test_minimum_treecCr[r\)r maximum_spanning_treerrr5r%rr"r^r r rtest_maximum_treeraz-MinimumSpanningTreeTestBase.test_maximum_treecCsntddtddfddtddfg}tj||jd}tt|ttds(Jtt| dd gs5JdS) NrrrHrrrrrrrr) r r dictr rrrMrangerr%r#rr_r r rtest_disconnecteds&z-MinimumSpanningTreeTestBase.test_disconnectedcCsHtd}tj||jd}tt|ttdsJ|dks"JdS)Nrrr) r empty_graphr rrr5rMrgnumber_of_edgesrhr r rtest_empty_graphs z,MinimumSpanningTreeTestBase.test_empty_graphcCst}|jdddddd|jdddddd|jdddd ddd |jd <tj||jd }|j|jks7Jt||s>J|D]\}}|j|||j||ksVJqBdS) Nrrredr)rcolordistancergreen bluebarfoor) r r rKgraphr rrr%adj)r#rr_r/r0r r rtest_attributess "z+MinimumSpanningTreeTestBase.test_attributescCst}|jddddd|jddddd|jddddd|dtj||jdd }tt|tt d s:Jt t| d d gsGJtj ||jdd }tt|tt d s]Jt t| d d gsjJdS)Nrrr)rrorrro)rrrrrrrrd) r r rKrYr rrr5rMrgrr%rbrhr r rtest_weight_attributes z1MinimumSpanningTreeTestBase.test_weight_attributeN)__name__ __module__ __qualname____doc__r&r8r;rErNrXrZr`rcrirlrwr{r r r rrs ( rc@seZdZdZdZddZdS) TestBoruvkaubUnit tests for computing a minimum (or maximum) spanning tree using Borůvka's algorithm. boruvkacCs6tj|jdd}tdd|D}t||jsJdS)u_Tests that using a Unicode string can correctly indicate Borůvka's algorithm. uborůvkarcsr(r)r*r-r r rr2r3z0TestBoruvka.test_unicode_name..N)r r4rr5rr!r6r r rtest_unicode_nameszTestBoruvka.test_unicode_nameN)r|r}r~rrrr r r rrs rc@seZdZddZddZdS)MultigraphMSTTestBasecCZt}|jddddd|jdddddtj}|||jdd}td gt|s+Jd S) z[Tests that the minimum spanning edges of a multigraph preserves edge keys. rrarkeyrbFr<)rrrN)r MultiGraphrKr4rrrM)r#r min_edges mst_edgesr r rtest_multigraph_keys_min z.MultigraphMSTTestBase.test_multigraph_keys_mincCr) z[Tests that the maximum spanning edges of a multigraph preserves edge keys. rrrrrrFr<)rrrN)r rrKr:rrrM)r#r max_edgesrr r rtest_multigraph_keys_maxrz.MultigraphMSTTestBase.test_multigraph_keys_maxN)r|r}r~rrr r r rrs rc@seZdZdZdZdS) TestKruskalzaUnit tests for computing a minimum (or maximum) spanning tree using Kruskal's algorithm. kruskalN)r|r}r~rrr r r rrsrc@s$eZdZdZdZddZddZdS)TestPrimz^Unit tests for computing a minimum (or maximum) spanning tree using Prim's algorithm. primcC\t}|jddddd|jdddddtj||jd}tdgt|jd d s,JdS) Nrrrrrrr)rrrrr])r rrKr rrrMr%rhr r rtest_multigraph_keys_tree  z"TestPrim.test_multigraph_keys_treecCr) Nrrrrrrr)rrrrr])r rrKrbrrrMr%rhr r rtest_multigraph_keys_tree_maxrz&TestPrim.test_multigraph_keys_tree_maxN)r|r}r~rrrrr r r rrs  rc@s(eZdZdZddZddZddZdS) TestSpanningTreeIteratoru Tests the spanning tree iterator on the example graph in the 2005 Sörensen and Janssens paper An Algorithm to Generate all Spanning Trees of a Graph in Order of Increasing Cost cCsgd}t|_|j|ddddifddddifddddifddddifgddddifddddifdddd ifddddifgddddifdddd ifddddifddddifgddddifddddifdddd ifddddifgddddifddddifdddd ifddddifgddddifdddd ifdddd ifddddifgddddifddddifddddifdddd ifgddddifdddd ifddddifdddd ifgg|_dS) N))rrr)rrr)rrr)rrr)rrr)rrrrrrrrrrrr)r r rr spanning_trees)r#r%r r rr&sX                                   z%TestSpanningTreeIterator.setup_methodcCsFd}t|jD]}t|jdd}t||j|sJ|d7}qdS)zZ Tests that the spanning trees are correctly returned in increasing order rTr]rNr SpanningTreeIteratorrr5r%rrr# tree_indextreer7r r r#test_minimum_spanning_tree_iterator_s  z Sample many spanning trees from the additive method. rrrrrrrrrrrHrr]rirF)rrrN)rrrrr r rKrr%rrgrrrrrrMr)rrr%rr/r0rrrrr1rrrrrrr r r(test_random_spanning_tree_additive_largesX          r)rrnetworkxr networkx.utilsrrrrrrrrrrmarkslowrrrr r r rs$@]" ["