networkx.generators.bipartite.bipartite_alternating_havel_hakimi_graph

bipartite_alternating_havel_hakimi_graph(aseq, bseq, create_using=None)

Return a bipartite graph from two given degree sequences using a alternating Havel-Hakimi style construction.

Parameters:

aseq : list or iterator

Degree sequence for node set A.

bseq : list or iterator

Degree sequence for node set B.

create_using : NetworkX graph instance, optional

Return graph of this type.

Nodes from the set A are connected to nodes in the set B by :

connecting the highest degree nodes in set A to :

alternatively the highest and the lowest degree nodes in set :

B until all stubs are connected. :

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.