def test_size(self):
assert 0 == Graph().size()
assert 1 == Graph([v, w], [vw, ]).size()
print('hi')
for n in range(8):
print(n)
g = Graph(make_vertices(n))
g.add_all_edges()
assert (n * (n - 1)) // 2 == g.size()
def test_add_all_edges(self):
g = Graph([v, x, w])
g.add_all_edges()
assert sorted(g.vertices()) == sorted([v, x, w])
assert len(g.edges()) == 3
def test_add_all_edges_empty(self):
g = Graph()
g.add_all_edges()
assert g.vertices() == []
assert g.edges() == []
