# Algorithm for generating random regular graphs in Maple

In Maples package RandomGraphs, there is a method called RandomRegularGraph(n,d) which takes a number of vertices $n$ and a degree $d$ and returns a random $d$-regular graph on $n$ vertices. Does anybody know how this random regular graph is sampled, and if it is in fact uniformly chosen from all $d$-regular graphs on $n$ vertices?

-