[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
## [igraph] subgraph enumeration given a labeled directed graph.

**From**: |
farscape2012 |

**Subject**: |
[igraph] subgraph enumeration given a labeled directed graph. |

**Date**: |
Thu, 19 Apr 2012 15:32:32 +0300 |

**User-agent**: |
Mozilla/5.0 (X11; U; Linux x86_64; en-US; rv:1.9.1.16) Gecko/20120207 Icedove/3.0.11 |

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
1--5) 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
_______________________________________________
igraph-help mailing list
address@hidden
https://lists.nongnu.org/mailman/listinfo/igraph-help