def SmallWorldTest():
"""
Creates an Erdos-Renyi graph of 1000 vertices and iterates through
p, checking the clustering coefficient each time. Uses pylot to
graph all that stuff, to see if there's anything interesting
"""
import matplotlib.pyplot as pyplot
vs = [Vertex(str(v)) for v in range(100)]
cs = []
ps = []
p = 0.01
for i in range(100):
print p
drg = DirectedRandomGraph(vs)
drg.add_random_edges(p)
ps.append(p)
cs.append(drg.clustering_coefficient())
p += 0.01
pyplot.plot(ps, cs)
pyplot.xlabel("p")
pyplot.ylabel("clustering coefficient")
pyplot.show()
