
    Gd                        d Z ddlZddlmZ  ej                    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j	        e          Z
 ej        e          Z ej        eedd            ej        eed            ej        eedd            ej        eed e                    d          D                         ej        e
edd	            ej        d            ej                     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                     	      
      	lightbluei  )
node_color	node_sizegrey)
edge_color   z
sans-serif)	font_sizefont_familyc                 ,    i | ]\  }}}||f|d          S )r    ).0uvds       1share/doc/networkx-3.1/examples/graph/plot_mst.py
<dictcomp>r   .   s(    OOOAq!Q8OOO    T)data)edge_labelsgreen)r   widthoff)__doc__networkxnxmatplotlib.pyplotpyplotpltGraphGadd_edges_fromminimum_spanning_treeTspring_layoutposdraw_networkx_nodesdraw_networkx_edgesdraw_networkx_labelsdraw_networkx_edge_labelsedgesaxisshowr   r    r   <module>r:      s	  
 
           BHJJ   	
A!}	
A!}	
A"~	
A!}	
A!}	
A!}	
A!}	
A!}	
A"~	
A"~	
A!}	
A!}	
A!}  & BQ bq  q#+ E E E E  q#& 1 1 1 1  3", G G G G  sOOAGGG<N<NOOO     q#' ; ; ; ;  




r    