Return a random bipartite graph G_{n,m,k}.
Produces a bipartite graph chosen randomly out of the set of all graphs with n top nodes, m bottom nodes, and k edges.
Parameters : | n : int
m : int
k : int
seed : int, optional
directed : bool, optional (default=False)
|
---|
See also
gnm_random_graph
Notes
If k > m * n then a complete bipartite graph is returned.
This graph is a bipartite version of the random graph model.
Examples
G = nx.bipartite_gnmk_random_graph(10,20,50)