U
    ª9%e£  ã                   @   sX  d Z ddlZddlmZ e ¡ Ze ddddifddddifddddifdd	ddifd	ddd	ifd	d
ddifd	dddifddddifdd
ddifdd
ddifd
ddd	ifddddifddddifg¡ e 	e¡Z
e e¡Zejeeddd ejeedd ejeeddd ejeedd„ ejddD ƒd eje
edd	d e d¡ e ¡  dS ) aC  
=====================
Minimum Spanning Tree
=====================

A minimum spanning tree (MST) is a subset of edges in a weighted, 
connected graph that connects all vertices together with the 
minimum possible total edge weight. The `minimum_spanning_tree`
function is used to compare the original graph with its MST.

é    Né   Úweighté   é   é   é   é   é   é   é	   é   é
   é   Z	lightblueiô  )Z
node_colorZ	node_sizeZgrey)Ú
edge_coloré   z
sans-serif)Z	font_sizeZfont_familyc                 C   s    i | ]\}}}||f|d  “qS )r   © )Ú.0ÚuÚvÚdr   r   úv/var/www/html/Darija-Ai-API/env/lib/python3.8/site-packages/../../../share/doc/networkx-3.1/examples/graph/plot_mst.pyÚ
<dictcomp>.   s      r   T)Údata)Zedge_labelsÚgreen)r   ÚwidthÚoff)Ú__doc__ZnetworkxÚnxZmatplotlib.pyplotZpyplotZpltZGraphÚGZadd_edges_fromZminimum_spanning_treeÚTZspring_layoutÚposZdraw_networkx_nodesZdraw_networkx_edgesZdraw_networkx_labelsZdraw_networkx_edge_labelsÚedgesZaxisÚshowr   r   r   r   Ú<module>   s@   óÿ

  ÿ
