
    GdI                        d Z ddlmZ ddlZdZdZdZ ej	        eee          Z
 ed            ej        e
          D ]3Z ee d ej        e
e           d ej        e
e                      4 e              ed	            ej        e
          D ]Z ee            ej        e
e          Z ej        e
e
            ej                     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__matplotlib.pyplotpyplotpltnetworkxnxnmr   gnm_random_graphGprintnodesvdegree
clusteringgenerate_adjlistlinespring_layoutr   drawshow     9share/doc/networkx-3.1/examples/graph/plot_erdos_renyi.py<module>r      sN               B14(((    	! : :A	EQ
8
81a
8
8=2=A#6#6
8
89999     B""  D	E$KKKKbqt$$$ s     




r   