is_digraphical(in_sequence, out_sequence)
This algorithm is from Kleitman and Wang . The worst case runtime is $O(s \times \log n)$ where $s$ and $n$ are the sum and length of the sequences respectively.
A sequence of integer node in-degrees
A sequence of integer node out-degrees
True if in and out-sequences are digraphic False if not.
Returns True if some directed graph can realize the in- and out-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