[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [igraph] partitioning a *weighted* undirected graph

From: Gábor Csárdi
Subject: Re: [igraph] partitioning a *weighted* undirected graph
Date: Tue, 21 Sep 2010 18:25:06 +0200

Hi Lara,

there are a couple of methods in igraph that can make use of edge
weights, I suggest you go to
and then search for 'community' and then see which ones of the
implemented algorithms are such.

Best Regards,

On Tue, Sep 21, 2010 at 5:40 PM, Lara Michaels
<address@hidden> wrote:
> Hello fellow igraphers!
> I just came across igraph (the R package) and am just getting started.
> I have read the docs to find out how to import the data I have into igraph 
> and have chosen to put it in 'ncol' format and then just use read.graph() as 
> described here 
> [http://cneurocvs.rmki.kfki.hu/igraphbook/igraphbook-foreign.html].
> Now I would like to attempt some form of community detection on this dataset 
> that would take into account the fact that edges are weighted and undirected. 
> Is there a particular method in igraph that is especially well-suited for 
> such this task? I have just started reading on the topic, but it seems that 
> most algorithms were conceived to deal with unweighted graphs.
> Many thanks for any help!
> ~lara
> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help

Gabor Csardi <address@hidden>     UNIL DGM

reply via email to

[Prev in Thread] Current Thread [Next in Thread]