[igraph] subgraph enumeration given a labeled directed graph.

[address@hidden]

Hi,

I used Igraph package in R time to time. I am not that familiar with 
that, but I can handle basic stuffs.

Now the problem I meet is that I would like to enumerate all the 
connected subgraphs or connected subgraphs with smaller node size (like 
5--10) given a graph which is directed and uniquely labelled. It's 
unknown whether there are circles in the graphs.

Do you have any idea how I can solve this problme?

Thanks

Br
Chengyu