[Nauty-list] geng 33 vertices and diameter 2

[Hoang Minh Nguyen]

Hi everyone,

	At the moment geng is limited to generating graphs of order up to
32. It seems that this restriction is due to the data structure used to
store intermediate graphs?

I would like to know if there is a way to modify geng to generate ALL graphs 
of order 33 with the restriction that the diameter of each graph is 2. 

Is there a good way to speed up the search given the diameter restriction?

It might be a hard problem but just ask in case someone has any idea :-).

Thanks,
Minh