o 3ήcw@s@dZddlZddlZddlZddlmmZej j Z ddZ ddZ ddZ Gd d d Zd d Zd dZGdddeZGdddeZGdddeZddZddZddZddZddZdd Zd!d"Zd#d$Zd%d&Zd'd(Zd)d*Zd+d,Zd-d.Z d/d0Z!d1d2Z"d3d4Z#d5d6Z$ej%j&d7d8Z'd9d:Z(dS);z-Unit tests for the traveling_salesman module.NcCstdtd}|D]\}}tdd|||d<qt}|tt || t |t |jdks>Jtj|dd}t}|tt ||| t |t |jdkseJdS)N*r weightr)randomseednxcomplete_graphedgesrandintGraphadd_edges_frompairwisenx_app christofidesremove_edges_from find_cyclelenminimum_spanning_tree)GuvHtreerf/tmp/pip-target-vg8gfxp4/lib/python/networkx/algorithms/approximation/tests/test_traveling_salesman.pytest_christofides_hamiltonian s  rcCs,td}|ddttjtj|dS)Nrr)r r remove_edgepytestraises NetworkXErrorrrrrrr"test_christofides_incomplete_graphs  r$cCsTtd}|ddt|}t|dt|kr%tt|ks(JJdSNr)r r add_edgerrrset)rcyclerrr"test_christofides_ignore_selfloops$   4r+c@seZdZeddZdS)TestBasecCst|_|jhdgd|_d|_t|_|jhdgd|_d|_t dt |_ t dt|_ t |_ |j dd ht|_|jdd ht |_|jhd gd|_d |_t |_|jhd gd|_d |_dS)N> BAr'Cr0 r2r/ r0r/r'r0r2r0Dr/r2r5r/r:r2r:r:r0r;r:r/r:r2r:r2r/r0r:?@> r/r0r/r2rEr2r0!r2r/ r2r:"r6r7r9r=rArBrDr:r0r/r2r:gJ@r&)rrr)rrEr'>r6r7r9r<r=r?@@>r0r/rr0r2rCr0r:r&r/r2r>r/r:r2r:r'g9@)r DiGraphDGadd_weighted_edges_fromDG_cycleDG_costDG2 DG2_cycleDG2_costr r unweightedUG unweightedDG incompleteUG incompleteDGUGUG_cycleUG_costUG2 UG2_cycleUG2_cost)clsrrr setup_class-s<          zTestBase.setup_classN)__name__ __module__ __qualname__ classmethodrmrrrrr-,sr-cCs||ksJ||ks JdSNrsolncostexp_solnexp_costrrrvalidate_solution| rxcCs.||ks||dddksJ||ksJdS)Nrrsrrrvalidate_symmetric_solutionsr{c@s4eZdZddZddZddZddZd d Zd S) TestGreedyTSPcstjjdd}tfddt|D}t||gddtjjdd}tfddt|D}t||gddtjjdd}tfd dt|D}t||gdd tjjdd}tfd dt|D}t||gd d dS)Nr:sourcec3&|]\}}j||dVqdSrNr[.0nnbrselfrr $z,TestGreedyTSP.test_greedy..rFrGc3rrr_rrrrrrgS@c3rrrfrrrrrrrRc3rrrirrrrrr)r:r2r0r/r:g;@) r greedy_tspr[sumrrxr_rfrirr*rurrr test_greedyszTestGreedyTSP.test_greedycCs,ttjtj|jttjtj|jdSrr)r r!r r"rrrdrerrrrtest_not_complete_graphsz%TestGreedyTSP.test_not_complete_graphcCst|jt|jdSrr)rrrbrcrrrrtest_not_weighted_graphryz%TestGreedyTSP.test_not_weighted_graphcsNtdht}tfddt|D}t||gdddS)NrrErc3$|] \}}||dVqdSrrrr#rrr"z/TestGreedyTSP.test_two_nodes..rE)r r r\rrrrrxrrr#rtest_two_nodess   zTestGreedyTSP.test_two_nodescCsTtd}|ddt|}t|dt|kr%tt|ks(JJdSr%)r r r(rrrr)rrr*rrrtest_ignore_selfloopsr,z#TestGreedyTSP.test_ignore_selfloopsN)rnrorprrrrrrrrrr|s  r|c@sVeZdZeejZddZddZddZ ddZ d d Z d d Z d dZ ddZdS)TestSimulatedAnnealingTSPcsXjjdddd}tfddt|D}t||jjgd}jj|ddd}tfddt|D}t||jjgd }jj|d ddd }tfd dt|D}t||jjjjdddd}tfd dt|D}t||jj jjdd ddd }tfddt|D}t||jj dS)Ngreedyr:rr~rc3rrrrrrrrrzNTestSimulatedAnnealingTSP.test_simulated_annealing_directed..)r:r/r0r2r:c3rrrrrrrrr)r:r0r2r/r:1-0mover~rc3rrrrrrrrrc3rrrrrrrrrc3rrrrrrrrr) tspr[rrrxr]r^r_r`rarr*ru initial_solrrr!test_simulated_annealing_directeds"z;TestSimulatedAnnealingTSP.test_simulated_annealing_directedcsjjdddd}tfddt|D}t||jjjjdddd}tfddt|D}t||j j jjddddd }tfd dt|D}t||j j dS) Nrr:rrc3rrrrrrrrrzPTestSimulatedAnnealingTSP.test_simulated_annealing_undirected..c3rrrrrrrrrrrc3rrrrrrrrr) rrfrrrxrgrhrir{rjrkrrrr#test_simulated_annealing_undirectedsz=TestSimulatedAnnealingTSP.test_simulated_annealing_undirectedcCs0tjt|j|jddttj|j|jddS)Nrr)r r! TypeErrorrrfr r"rrrr!test_error_on_input_order_mistakesz;TestSimulatedAnnealingTSP.test_error_on_input_order_mistakecCs8tjtj|j|jdddtjtj|j|jddddS)Nrrr})r r!r r"rrdrerrrrrsz1TestSimulatedAnnealingTSP.test_not_complete_graphcCsVtd}|dd||d}t|dt|kr&tt|ks)JJdS)Nr&r'rr)r r r(rrr)rrrrrs   4z/TestSimulatedAnnealingTSP.test_ignore_selfloopscCs ||jd||jddS)Nr)rrbrcrrrrrsz1TestSimulatedAnnealingTSP.test_not_weighted_graphcstdh|jdddd}tfddt|D}t||gdd|jgdddd}tfd dt|D}t||gdddS) Nrrrrrc3rrrrr#rrrrz;TestSimulatedAnnealingTSP.test_two_nodes..rEc3rrrrr#rrrr)r r r\rrrrxrrr#rrs z(TestSimulatedAnnealingTSP.test_two_nodesc sjjddddddd}tfddt|D}t|||jks&Jgd }jj|ddd dddd }tfd dt|D}t|||jksQJdS) Nrr:rrr)r~ralphaN_innerrc3rrrrrrrrrz_TestSimulatedAnnealingTSP.test_failure_of_costs_too_high_when_iterations_low..rQg?)r~rrrmax_iterationsrc3rrrrrrrr r)rr_rrprintrar[r^rrrr2test_failure_of_costs_too_high_when_iterations_lows(  zLTestSimulatedAnnealingTSP.test_failure_of_costs_too_high_when_iterations_lowN)rnrorp staticmethodrsimulated_annealing_tsprrrrrrrrrrrrrrs   rc@seZdZeejZddZdS)TestThresholdAcceptingTSPc sjjddddddd}tfddt|D}|jks!Jgd }jj|ddd d d }tfd dt|D}|jksEJdS)Nrr:rrr@)r~rrrrc3rrrrrrrrrz_TestThresholdAcceptingTSP.test_failure_of_costs_too_high_when_iterations_low..rQr)r~r thresholdrc3rrrrrrrr&r)rr_rrrar[r^rrrrrs" zLTestThresholdAcceptingTSP.test_failure_of_costs_too_high_when_iterations_lowN)rnrorprrthreshold_accepting_tsprrrrrrrs  rcCsNtd}d|ddd<dd}tj||dd }t||gd ks%JdS) N rr@r&rcSstj|d|dddS)Nrr@rrrrrrrrr my_tsp_method/sz&test_TSP_method..my_tsp_methodF)methodr* r@r'rErrrXr&)r cycle_graphrtraveling_salesman_problemr)rrpathrrrtest_TSP_method+s rcCsdtd}tj|ddgdd}|gdgdfvsJtj|ddgd}|gd gd fvs0JdS) Nrr'rF)nodesr*)r'r@r&r)rr&r@r')r)r'r@r&rr&r@r')rr&r@r'r@r&r)r rrr)rrr*rrrtest_TSP_unweighted7s rc Cstd}d|ddd<d|ddd<d|ddd<d|ddd<d|ddd<d|dd d<d|d d d<d|d d d<d|d dd<tj}gd gd f}gdgdf}gdgdf}||dd gdd}||vswJ||dd gddd}||vsJ||ddd}||vsJtjtjddddg}|D]1} ||dd gd| d}||vsJ||dd gd| dd}||vsJ||d| dd}||vsJqdS)NrrErrrr'r@r&rrrX)r'rErrrXrr)rrrXrrrEr') r'rErrrXrrrrXrrrEr') rrrXrrrEr'rErrrXrr) r&rrrXrrrEr'r@r)rrF)rrr*)rr*cStj|d|dSNrrrrwtrrrez#test_TSP_weighted..cSrr)rrrrrrrfr)rrr)rrrr*)rrr*)r rrrrr) rrexpected_pathsexpected_cyclesexpected_tourpathsr*rtourpathmethodsrrrrtest_TSP_weighted@sF      rcCstd}|gdd|ddd<t|}t|t|dkr+tt|dks-Jtj|dd }t|t|d krFtt|dksHJdS) Nr))r@r)rr)r )rrr&r@rr8r5F)r*r3)r rrrrrrr))rr*rrrr$test_TSP_incomplete_graph_short_pathss   $rc Cddlmmm}td}td|gdgdgdgdgd gd g}gd }tj|tj d }| |\}}t |d dksIJt }| |tj |j|js]JdS)z> Test the Held-Karp relaxation with the ascent method rNnumpyscipy)ra<Ir84)rr)rZrI)rrr#r)rrrr_.)r8rrrrQ)rrIrrrr)rr')rEr@r'rEr@r)r&rrr& create_usingrEgi@4networkx.algorithms.approximation.traveling_salesman algorithms approximationtraveling_salesmanr importorskiparrayr from_numpy_arrayrZheld_karp_ascentroundrutils edges_equalr rnpG_arraysolution_edgesropt_hkz_starsolutionrrrtest_held_karp_ascents&    rc s(ddlmmm}td}td|gdgdgdgdgd gd g}id d d d dddd dddddd ddddddddddddddddddddd ditj|tj d!}| |\}t |d"d#ks~Jfd$d%Dfd&d%DksJdS)'z Test the ascent method using a modified version of Figure 2 on page 1140 in 'The Traveling Salesman Problem and Minimum Spanning Trees' by Held and Karp rNrr)rdr順rr)rrrrrr)rrrrrr)rrrrrr)rrrrrr)rrrrrrrr竪?rrEr竪?rrrrEUUUUUU?rr@rErrErrEr'rr'r@r'r&?r@rr@r'r@r&r&rr&r'r&r@rrEgr@ci|] }|t|dqSr@rrkeyrrr z3test_ascent_fractional_solution..cr r r rsolution_z_starrrr rrrrr rrr rrZrrrrrrrrrrrtest_ascent_fractional_solutionsn        rc Csddlmmm}td}td|gdgdgdgdgd gd gd g}gd }tj|tj d }| |\}}t |ddksLJt }| |tj |j|js`JdS)q Tests the ascent method using a truly asymmetric graph for which the solution has been brute forced rNrrr?;Er>r[5KW/r'RrrrCrDr&r:rP]rr.r$7r=OXr%r3Lbr(rr2r1r5r-r)rrrrEr&)r&rr)rr@rrEgg@rrrrrtest_ascent_method_asymmetrics(    r<c Cr)rrNrr)rr:'\r )Hrr@r5rr)rrrr7Fr$)1Grrr7^)Jr+rr')8rGr'Ar)rr r)r'rrr@rErrEgb@rrrrrtest_ascent_method_asymmetric_2s&    rLc Csddlmmm}td}td|gdgdgdgdgd gd g}gd }gd }tj|tj d }| |\}}t |ddksMJt }| |t } | |tj |j|jsstj |j| jsuJdSdS)a Tests the ascent method using a truly asymmetric graph with a fractional solution for which the solution has been brute forced. In this graph their are two different optimal, integral solutions (which are also the overall atsp solutions) to the Held Karp relaxation. However, this particular graph has two different tours of optimal value and the possible solutions in the held_karp_ascent function are not stored in an ordered data structure. rNrr)rrr&rErr@)rrrrrr@)r@rrrrEr)rrErrr@r@)r&r&r@r@rr')r'rrr'r@r)rr'rr;r'rrKr)rMrNrrr)r&rErrEg*@r) rrrsolution1_edgessolution2_edgesrrr solution1 solution2rrr"test_held_karp_ascent_asymmetric_3$s0     rSc s(ddlmmm}td}td|gdgdgdgdgd gd g}id d d d dddd dd dddd dd dddddd dd dddd dd dddd dd itj|tj d}| |\}t |d d!ks~Jfd"d#Dfd$d#DksJdS)%z Tests the ascent method using a truly asymmetric graph with a fractional solution for which the solution has been brute forced rNrr)rrrrr)rTrrrrr)rrTrrrr)rrrrrTr)rrErrrrT)rErrrTrrrrrrrrrrrrrrrrrrrrr r rrEgs@cr r r rrrrrrz?test_held_karp_ascent_fractional_asymmetric..cr r r rrrrrrrrrrr+test_held_karp_ascent_fractional_asymmetricQsn        rUc s ddlmmm}tdtdidddddd d dd d d d dddd dd dd dd dddd dd dddd ddddi}ddddddddd d! }t}|D]\}}||f|jvss||f|jvrtqa| ||qa| ||fd"d#D|ksJdS)$aY Test that we can create an exponential distribution of spanning trees such that the probability of each tree is proportional to the product of edge weights. Results of this test have been confirmed with hypothesis testing from the created distribution. This test uses the symmetric, fractional Held Karp solution. rNrrrrrrrrrrrrrrrrrrrrrrr r gw-!lgUg?g?5^I ҿgDJտgW2) rrrrrrr r rcr r r rgammarrrrz3test_spanning_tree_distribution..) rrrrr rr MultiGraphr r(spanning_tree_distribution)rrsolution_gammarrrrrVrtest_spanning_tree_distributionsr         r[cCsftdtdgd}t}||dd}tj|d|d}gdgd g}||vs1Jd S) z Test the complete asadpour tsp algorithm with the fractional, symmetric Held Karp solution. This test also uses an incomplete graph as input. rr))rrr)rrEr)rr&r)rrEr)rr@r)rEr'r)r'r@r)r'r&r)r@r&r)rrr)rErr)r&rr)rErr)r@rrr'rEr)r@r'r)r&r'r)r&r@rcSt||dS)Nr-r asadpour_atsprrrrfixed_asadpourz)test_asadpour_tsp..fixed_asadpourrrr)rr@r&rrEr'rEr)r'rErrr@r&r'N)r rr rZr\rr) edge_listrr`tourexpected_toursrrrtest_asadpour_tsps   rfc Cstd}td|gdgdgdgdgdgdg}d d d d d dd}gdgdg}tj|tjd}tj||dddd}tj|d|d}||vsTJdS)a This test uses airline prices between the six largest cities in the US. * New York City -> JFK * Los Angeles -> LAX * Chicago -> ORD * Houston -> IAH * Phoenix -> PHX * Philadelphia -> PHL Flight prices from August 2021 using Delta or American airlines to get nonstop flight. The brute force solution found the optimal tour to cost $872 This test also uses the `source` keyword argument to ensure that the tour always starts at city 0. rrrir{i)rrsroi/rkrsrurvirprvr?rliLrnrvryrJFKLAXORDIAHPHXPHLrrrEr'r@r&)r{r|rr}r~rr{)r{r}rr|r~rr{rFcopycSstj||dddS)N%r{r}r^rrrrr`(sz0test_asadpour_real_world..fixed_asadpourrrbN r rrr rrZ relabel_nodesrr)rrnode_maprerr`rdrrrtest_asadpour_real_worlds(   rc Cstd}td|gdgdgdgdgdgdg}d d d d d dd}gdgdg}tj|tjd}tj||dddd}tj|dd|d}||vsUJdS)a This test uses airline prices between the six largest cities in the US. This time using a path, not a cycle. * New York City -> JFK * Los Angeles -> LAX * Chicago -> ORD * Houston -> IAH * Phoenix -> PHX * Philadelphia -> PHL Flight prices from August 2021 using Delta or American airlines to get nonstop flight. The brute force solution found the optimal tour to cost $872 rrrgrmrrrurwrzr{r|r}r~rrr)r}rr|r~rr{)r{rr~r}rr|rFrcSr])NrHr^rrrrr`Xraz5test_asadpour_real_world_path..fixed_asadpourr)rr*rNr)rrrrrr`rrrrtest_asadpour_real_world_path0s,   rcCs>tjdtjd}t|dd|dttjtj |dS)zi Test that the proper exception is raised when asadpour_atsp is given an disconnected graph. r@rrrr&N) r r rZset_edge_attributesadd_noder r!r"rr_r#rrr test_asadpour_disconnected_graphbs rcCs@tjdtjd}t|dd|ddttjtj |dS)zf Test that the proper exception is raised when asadpour_atsp is given an incomplete graph r@rrrrN) r r rZrrr r!r"rr_r#rrrtest_asadpour_incomplete_graphqs rcCst}ttjtj|dS)z= Test the asadpour_atsp function with an empty graph N)r rZr r!r"rr_r#rrrtest_asadpour_empty_graphsrc Cstd}|gdgdgdgdgdgdgdg}tj|tjd }td D]}tj|tj d }gd |ks=Jq+d S)ar This test uses an integral held karp solution and the held karp function will return a graph rather than a dict, bypassing most of the asadpour algorithm. At first glance, this test probably doesn't look like it ensures that we skip the rest of the asadpour algorithm, but it does. We are not fixing a see for the random number generator, so if we sample any spanning trees the approximation would be different basically every time this test is executed but it is not since held karp is deterministic and we do not reach the portion of the code with the dependence on random numbers. rrr!r(r+r0r4r9rrE)r) rr'rEr&rErr@rrN) r rrr rrZrangerrr_)rrr_rdrrr test_asadpour_integral_held_karps  rcCs:tdgd}t}||ttjtj|dS)zP Test the asadpour algorithm with a graph without a hamiltonian circuit r) )rrr)rrEr)rr'r5)rrEr@)rr'r)rErr')rEr'rE)r'rr&r\N) r rr rZr\r!r"rr)r rrrrtest_directed_tsp_impossibles  r))__doc__rr networkxr !networkx.algorithms.approximationrrrrrrr$r+r-rxr{r|rrrrrrrrr<rLrSrUr[rfrrrrrmarkslowrrrrrrsFP(a  3#9#"-5=;22  #