code: 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 = nx.complete_graph(m, create_using=nx.DiGraph)
          assert nx.number_of_nodes(g) == m
          assert nx.number_of_edges(g) == m * (m - 1)
  
      g = nx.complete_graph("abc", create_using=nx.DiGraph)
      assert len(g) == 3
      assert g.size() == 6
      assert g.is_directed()
  
imports: import itertools
  import typing
  import pytest
  import networkx
  from networkx.algorithms.isomorphism.isomorph import graph_could_be_isomorphic
  from networkx.utils import edges_equal, nodes_equal
label_desc: Use image node_id 12 for calling the TestGeneratorClassic obj's underlying member method code with example usage: obj.test_complete_digraph() without return types