I'm trying to write a function in GAP (this is the first time I am using it) and I want to loop through like the "first" $1000$ non-complete, non-empty regular graphs. Do I have to construct this function or is it included in GRAPE (I didn't find it). Furthermore: if I have to construct this list is there an efficient way to generate non-isomorphic regular graphs?
Thanks in advance!
There is a tool, geng, in the nauty package which will generate regular graphs quickly enough; my understanding is that the nauty stuff is accessible in GAP.