Generators - Random Graphs
----------------------------

>>> from networkx import *
>>> from networkx.generators.random_graphs import *


Smoke test the random graphs
----------------------------

>>> G=gnp_random_graph(100,0.25)
>>> G=binomial_graph(100,0.25)
>>> G=erdos_renyi_graph(100,0.25)
>>> G=fast_gnp_random_graph(100,0.25)
>>> G=gnm_random_graph(100,20)
>>> G=dense_gnm_random_graph(100,20)

>>> G=watts_strogatz_graph(10,2,0.25)
>>> len(G)
10
>>> G.number_of_edges()
10
>>> G=watts_strogatz_graph(10,4,0.25)
>>> len(G)
10
>>> G.number_of_edges()
20

>>> G=newman_watts_strogatz_graph(10,2,0.0)
>>> len(G)
10
>>> G.number_of_edges()
10
>>> G=newman_watts_strogatz_graph(10,4,0.25)
>>> len(G)
10
>>> G.number_of_edges() >= 20
True


>>> G=barabasi_albert_graph(100,1)
>>> G=powerlaw_cluster_graph(100,1,1.0)


>>> G=random_regular_graph(10,20)
>>> G=random_regular_graph(3,21)
Traceback (most recent call last):
...
NetworkXError: n * d must be even

>>> constructor=[(10,20,0.8),(20,40,0.8)]
>>> G=random_shell_graph(constructor)        


This test fails sometimes because of not enough tries
and takes too long for more tries...
s=random_powerlaw_tree_sequence(10,gamma=3,tries=1000)
s=random_powerlaw_tree(10,gamma=3,tries=1000)

