U
    hI                  
   @   s   d Z ddlmZ ddlZdZdZdZej	eeedZ
ed ee
D ],Zee dee
e dee
e  qFe  ed	 ee
D ]Zee qeje
edZeje
ed
 e  dS )u  
===========
Erdos Renyi
===========

Create an G{n,m} random graph with n nodes and m edges
and report some properties.

This graph is sometimes called the Erdős-Rényi graph
but is different from G{n,p} or binomial_graph which is also
sometimes called the Erdős-Rényi graph.
    N
      iN  )seedznode degree clustering zthe adjacency list)pos)__doc__Zmatplotlib.pyplotZpyplotZpltZnetworkxZnxnmr   Zgnm_random_graphGprintZnodesvZdegreeZ
clusteringZgenerate_adjlistlineZspring_layoutr   Zdrawshow r   r   q/tmp/pip-unpacked-wheel-j2te_plx/networkx-3.1.data/data/share/doc/networkx-3.1/examples/graph/plot_erdos_renyi.py<module>   s    *
