@nodes_or_number(0)
def empty_graph(n=0, create_using=None):
 if (create_using is None):
  G = nx.Graph()
 else:
  G = create_using
  G.clear()
 (n_name, nodes) = n
 G.name = ('empty_graph(%s)' % (n_name,))
 G.add_nodes_from(nodes)
 return G

@ nodes_or_number ( 0 ) def empty_graph ( n = 0 , create_using = None ) : if ( create_using is None ) : G = nx . Graph ( ) else : G = create_using G . clear ( ) ( n_name , nodes ) = n G . name = ( 'empty_graph(%s)' % ( n_name , ) ) G . add_nodes_from ( nodes ) return G
return the empty graph with n nodes and zero edges .