This documents an unmaintained version of NetworkX. Please upgrade to a maintained version and see the current NetworkX documentation.


complete_bipartite_graph(n1, n2, create_using=None)[source]

Return the complete bipartite graph K_{n1_n2}.

Composed of two partitions with n1 nodes in the first and n2 nodes in the second. Each node in the first is connected to each node in the second.

Node labels are the integers 0 to n1+n2-1