is_valid_directed_joint_degree(in_degrees, out_degrees, nkk)
Here is the list of conditions that the inputs (in/out degree sequences, nkk) need to satisfy for simple directed graph realizability:
Condition 0: in_degrees and out_degrees have the same length
Condition 1: nkk[k][l] is integer for all k,l
Condition 2: sum(nkk[k])/k = number of nodes with partition id k, is an
integer and matching degree sequence
Condition 3: number of edges and non-chords between k and l cannot exceed
maximum possible number of edges
in degree sequence contains the in degrees of nodes.
out degree sequence contains the out degrees of nodes.
directed joint degree dictionary. for nodes of out degree k (first level of dict) and nodes of in degree l (seconnd level of dict) describes the number of edges.
returns true if given input is realizable, else returns false.
Checks whether the given directed joint degree input is realizable
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