'A tournament must not have any pair of nodes without at least
one edge joining the pair.'

def test_missing_edges(self):

    G = DiGraph()
    G.add_edges_from([(0, 1), (1, 2), (2, 3), (3, 0), (1, 3)])
    assert_false(is_tournament(G))
