
From:  address@hidden 
Subject:  [igraph] subgraph enumeration given a labeled directed graph. 
Date:  Thu, 12 Apr 2012 22:40:25 +0300 
Useragent:  Mozilla/5.0 (Windows NT 6.1; rv:11.0) Gecko/20120327 Thunderbird/11.0.1 
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 510) 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
[Prev in Thread]  Current Thread  [Next in Thread] 