directed_havel_hakimi_graph(in_deg_sequence, out_deg_sequence, create_using=None)
Algorithm as described by Kleitman and Wang .
Each list entry corresponds to the in-degree of a node.
Each list entry corresponds to the out-degree of a node.
Graph type to create. If graph instance, then cleared before populated.
If the degree sequences are not digraphical.
A graph with the specified degree sequences. Nodes are labeled starting at 0 with an index corresponding to the position in deg_sequence
Returns a directed graph with the given degree sequences.
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them