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_complete(self):
"""a two-vertex complete graph is strongly connected."""
v = Vertex('v')
w = Vertex('w')
dg = DirectedGraph([v,w])
dg.add_all_edges()
self.assertTrue(dg.is_strongly_connected())
