U 9%e @s.dZddlmZddlZddlmmZ ddl Z ej ddddZ e e dZded<e ZeeeD]dZeed eeD]LZe eedeedeed eed ZeZe jeeed qqje je d d ZeejeZejeed d deje ededddde dee!dS)ac ========================== Traveling Salesman Problem ========================== This is an example of a drawing solution of the traveling salesman problem The function is used to produce the solution is christofides, where given a set of nodes, it calculates the route of the nodes that the traveler has to follow in order to minimize the total cost. Ng?)Zradiusseedpos)?r)weightrbluer) edge_colorwidthTred)Z with_labelsZedgelistr Z node_sizer zThe route of the traveller is:)"__doc__Zmatplotlib.pyplotZpyplotZpltZnetworkxnxZ!networkx.algorithms.approximationZ algorithmsZ approximationZnx_appmathZrandom_geometric_graphGZget_node_attributesrcopyHrangelenijhypotdistZadd_edgeZ christofidescyclelistutilspairwiseZ edge_listZdraw_networkx_edgesZ draw_networkxprintshowr r x/var/www/html/Darija-Ai-API/env/lib/python3.8/site-packages/../../../share/doc/networkx-3.1/examples/drawing/plot_tsp.pys6  4