Return a random bipartite graph from two given degree sequences.
Parameters : | aseq : list or iterator
bseq : list or iterator
create_using : NetworkX graph instance, optional
seed : integer, optional
Nodes from the set A are connected to nodes in the set B by : choosing randomly from the possible free stubs, one in A and : one in B. : |
---|
Notes
The sum of the two sequences must be equal: sum(aseq)=sum(bseq) If no graph type is specified use MultiGraph with parallel edges. If you want a graph with no parallel edges use create_using=Graph() but then the resulting degree sequences might not be exact.
The nodes are assigned the attribute ‘bipartite’ with the value 0 or 1 to indicate which bipartite set the node belongs to.