U ‡d¨iã @s.dZddlmZddlZddlmmZ ddl Z ej ddddZ e  e d¡Zded<e  ¡ZeeeƒƒD]dZeed eeƒƒD]LZe  eedeedeed eed ¡ZeZe jeeed q€qje je d d Zeej e¡ƒZejeed d deje ededddde deƒe !¡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. éNégš™™™™™Ù?é)ZradiusÚseedÚpos)çà?ré)ÚweightrZbluer)Ú edge_colorÚwidthTZredéÈ)Z with_labelsZedgelistr Z node_sizer zThe route of the traveller is:)"Ú__doc__Zmatplotlib.pyplotZpyplotZpltZnetworkxZnxZ!networkx.algorithms.approximationZ algorithmsZ approximationZnx_appÚmathZrandom_geometric_graphÚGZget_node_attributesrÚcopyÚHÚrangeÚlenÚiÚjÚhypotÚdistZadd_edgeZ christofidesÚcycleÚlistÚutilsZpairwiseZ edge_listZdraw_networkx_edgesZ draw_networkxÚprintÚshow©rrúk/tmp/pip-unpacked-wheel-xknz3u3n/networkx-3.1.data/data/share/doc/networkx-3.1/examples/drawing/plot_tsp.pyÚs6  4ù