[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] community detection algorithms
|
From: |
Larson, TR |
|
Subject: |
Re: [igraph] community detection algorithms |
|
Date: |
Tue, 23 Mar 2010 19:37:12 +0000 |
|
User-agent: |
Thunderbird 2.0.0.24 (Windows/20100228) |
Sure, please find attached as an R object. I generate the graph as follows:
G <- graph.edgelist(all.corr.mat[,c("fromID","toID")],directed=F)
E(G)$weight <- count.multiple(G)
G <- simplify(G)
and then do the community detection as previously described
thanks
Tony
Tamas Nepusz wrote:
Hi,
Can you please send me a (possibly small) example network on which I
could reproduce the problem?
all.corr.mat.RData
Description: Binary data