a random graph: G(n,p) which generates graphs with n nodes and edges between any two nodes with the probability (p)

RandomGraph.py

from Graph import (
    Graph,
    Edge,
    Vertex,
)
import random

class RandomGraph(Graph):
    """
    create a random graph with the probability (p)
    """
    def add_random_edges(self, p):
        vs = self.vertices()
        max = len(vs)
        for i in xrange(max):
            for j in xrange(i+1, max):
                if random.random() <= p:
                    e = Edge(vs[i],vs[j])
                    self.add_edge(e)

def create_graph_with(vertices):
    vs = [Vertex(word) for word in vertices]
    return RandomGraph(vs)

def friendship_graph():
    vertices = ['Tatsu','Jack','Mack','Alex','Allen','Bob','Paul']
    g = create_graph_with(vertices)
    g.add_random_edges(0.3)
    draw_graph(g)
            
    
def draw_graph(g):
    from GraphWorld import *
    layout = CircleLayout(g)

    # draw the graph
    gw = GraphWorld()
    gw.show_graph(g, layout)
    gw.mainloop()



if __name__ == '__main__':
    import sys
    friendship_graph()