random_regular_graph(d, n, seed=None)
The resulting graph has no self-loops or parallel edges.
The nodes are numbered from $0$ to $n - 1$.
Kim and Vu's paper shows that this algorithm samples in an asymptotically uniform way from the space of random graphs when $d = O(n^{1 / 3 - \epsilon})$.
The degree of each node.
The number of nodes. The value of $n \times d$ must be even.
Indicator of random number generation state. See Randomness<randomness>
.
If $n \times d$ is odd or $d$ is greater than or equal to $n$.
Returns a random $d$-regular graph on $n$ nodes.
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