ó
 ,µ[c           @   sÏ  d  Z  d d l j Z d d l m Z e j d d ƒ Z g  Z d GHx_ e j	 ƒ  D]Q Z
 e e j e e
 ƒ ƒ Z d j e
 e ƒ GHx e D] Z e j e e ƒ q… WqO Wd GHd	 e e ƒ e e ƒ GHi  Z x7 e D]/ Z e e k rô e e c d
 7<qÏ d
 e e <qÏ Wd GHd GHe j ƒ  Z x' e e ƒ D] Z d e e e f GHq%Wd e j e ƒ GHd e j e ƒ GHd e j e ƒ GHd e j e ƒ GHd e j e ƒ GHd e j e ƒ GHe j e d e ƒe j  ƒ  d S(   s[   
==========
Properties
==========

Compute some network properties for the lollipop graph.
iÿÿÿÿN(   t   nxi   i   s   source vertex {target:length, }s   {} {} t    s   average shortest path length %si   s   length #pathss   %s %ds
   radius: %ds   diameter: %ds   eccentricity: %ss
   center: %ss   periphery: %ss   density: %st   with_labels(!   t   __doc__t   matplotlib.pyplott   pyplott   pltt   networkxR    t   lollipop_grapht   Gt   pathlengthst   nodest   vt   dictt"   single_source_shortest_path_lengtht   splt   formatt   pt   appendt   sumt   lent   distt   keyst   vertst   sortedt   dt   radiust   diametert   eccentricityt   centert	   peripheryt   densityt   drawt   Truet   show(    (    (    s8   share/doc/networkx-2.2/examples/basic/plot_properties.pyt   <module>   s<   