On 3/6/10 4:58 AM, Yannick Rochat wrote:
Hello,
>From a graph g, I'd like to create the reduced graph whom nodes are the
communities of g and edges are induced by those of g. I don't see an
easy way to do this (the complicated ways, I see a lot of them). Is
there are function in igraph that can reduce a graph ?
I think you can use subgraph(g, V(g)[clust==i]) where clust holds
members of communities. This gives you subgraphs using the edges of g
and community vertices. Then I think(I didn't try) you can use disjoint
union function to merge all the subgraphs, then you end up with induced
graphh?
Hope this works
Harun
Thanks !
Yannick
---------------------------------------------------------------
Yannick Rochat - IMA - Université de Lausanne
http://www.unil.ch/unisciences/YannickRochat
_______________________________________________
igraph-help mailing list
address@hidden
http://lists.nongnu.org/mailman/listinfo/igraph-help
|