def test_complete_digraph(self):
        # complete_graph(m) is a connected graph with
        # m nodes and  m*(m+1)/2 edges
        for m in [0, 1, 3, 5]:
            g = complete_graph(m,create_using=nx.DiGraph())
            assert_true(number_of_nodes(g) == m)
            assert_true(number_of_edges(g) == m * (1 - m))

        g = complete_graph("abc", create_using=nx.DiGraph())
        assert_equal(len(g), 3)
        assert_equal(g.size(), 6)
        assert_true(g.is_directed())
dataset/ETHPy150Open networkx/networkx/networkx/generators/tests/test_classic.py/TestGeneratorClassic.test_complete_digraph/swapped operands of `-`