[Nauty] forbidden subgraphs in directed graphs

[Sterten at aol.com]

well, I can do :
 
geng n | directg -T > file
 
and then filter file.
But that's not very efficient and file can become large.
 
 
with undirected graphs you can use the "prune" of geng and check
all forbidden subgraphs. That works well and something similar
for directed graphs would be fine.
 
But directg works differently than geng, it reads undirected graphs and  then 
orients the edges in all possible ways.
 
A routine which builds (n+1) digraphs from (n-)digraphs would be better  here.
It should be possible !?
 
 
Guenter.
 
 
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://mailman.anu.edu.au/mailman/private/nauty/attachments/20040909/8de7e97b/attachment.html