docstr: Test that the local efficiency for a complete graph with at least 3
  nodes should be one. For a graph with only 2 nodes, the induced
  subgraph has no edges.
docstr_tok: ["Test","that","the","local","efficiency","for","a","complete","graph","with","at","least","3","nodes","should","be","one",".","For","a","graph","with","only","2","nodes",",","the","induced","subgraph","has","no","edges","."]
code: def test_local_efficiency_complete_graph(self):
      """
      Test that the local efficiency for a complete graph with at least 3
      nodes should be one. For a graph with only 2 nodes, the induced
      subgraph has no edges.
      """
      for n in range(3, 10):
          G = nx.complete_graph(n)
          assert nx.local_efficiency(G) == 1
  
file_path: networkx/networkx/algorithms/tests/test_efficiency.py
imports: import networkx
label_desc: Use image node_id 7 for calling the TestEfficiency obj's underlying member method code with example usage: obj.test_local_efficiency_complete_graph() without return types