I'm looking for a digraph dataset that can return all directed graphs satisfying certain requirements. 


Following are some examples:


1. All tournament with 12 vertices;
2. All connected digraphs with 10 vertices;
3. All digraphs with 9 vertices whose underlying undirected graph bipartite.


Is there a digraph dataset that can produce some examples mentioned above?



Is there any digraph data set that gives all directed graphs satisfying certain requirements?
There are 154108311168 tournaments on 12 vertices and you can make them with the tool gentourng that comes with [nauty](https://cs.anu.edu.au/~bdm/nauty/). 


The number of connected digraphs on 10 vertices is more than 10^20, which is impossibly many. That's if you allow 2-cycles; otherwise the number is "only" about 10^15 and you can make them if you don't mind spending weeks of computer time.


The number of directed bipartite graphs on 9 vertices is 414967973 and if you don't allow 2-cycles there are only 1514031 (including disconnected). You can make them in seconds using geng+watercluster2 in the nauty package.


