1 | initial version |
You can have a look at:
sage: digraphs?
and read starting from ORDERLY GENERATION
section. Indeed, digraphs
is also a function that can generate isomorphism classes of digraphs with some property, as long as that property is stable with respect to vertex or edge deletion. Perhaps you could tune a property
corresponding to your problem (which is not clear from your description).