def fraction_connected(n, p, count=20):
"""Return fraction of RandomGraphs G(n,p) that are connected."""
vertices = make_vertices(n)
connected = 0.0
for i in range(count):
g = RandomGraph(vertices)
g.add_random_edges(p)
if g.is_connected():
connected += 1
return connected / count
from graph import Graph, RandomGraph, make_vertices
def draw(graph, size=500):
layout = CircleLayout(graph)
gw = GraphWorld(width=size, height=size)
gw.show_graph(graph, layout)
gw.mainloop()
def regular(vertices, degree):
degree = int(degree)
graph = Graph(vertices)
graph.add_regular_edges(degree)
return graph
def random(vertices, p):
p = float(p)
graph = RandomGraph(vertices)
graph.add_random_edges(p)
return graph
if __name__ == "__main__":
order = int(sys.argv[1])
vertices = make_vertices(order)
# graph = regular(vertices, sys.argv[2])
graph = random(vertices, sys.argv[2])
draw(graph)
