5.2.3. networkx.generators.classic.complete_graph¶

networkx.generators.classic.complete_graph(n, create_using=None)[source]¶

Return the complete graph K_n with n nodes.

Parameters:	n : int or iterable container of nodes If n is an integer, nodes are from range(n). If n is a container of nodes, those nodes appear in the graph. create_using : Graph, optional (default None) If provided this graph is cleared of nodes and edges and filled with the new graph. Usually used to set the type of the graph.

Examples

>>> G = nx.complete_graph(9)
>>> len(G)
9
>>> G.size()
36
>>> G = nx.complete_graph(range(11,14))
>>> list(G.nodes())
[11, 12, 13]
>>> G = nx.complete_graph(4, nx.DiGraph())
>>> G.is_directed()
True