def test_is_complete(self):
v = Vertex('v')
w = Vertex('w')
dg = DirectedGraph([v,w])
dg.add_all_edges()
self.assertTrue(dg.is_complete())
def test_random_directed_graph(self):
vs = [Vertex(str(x)) for x in range(100)]
rdg = DirectedGraph(vs)
rdg.add_random_arcs(p=.2)
self.assertFalse(rdg.is_complete())
