[Top][All Lists]

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

[igraph] Clique Percolation Algorithm

From: EthanK Gough
Subject: [igraph] Clique Percolation Algorithm
Date: Thu, 5 Dec 2013 11:07:11 -0800

Hi Csardi

Do you have plans to add a clique percolation function to the igraph package?

I tried the "quick (and rather inefficient)" function provided on the igraph wikidot page: http://igraph.wikidot.com/community-detection-in-r. However, it is indeed very slow.

I'm just curious if there are any plans to add this functionality to igraph and to improve on it.


On Wed, Dec 4, 2013 at 10:14 AM, EthanK Gough <address@hidden> wrote:
Hi Gabor

I have another quick question. So if the edge weights are added when calculating the lengths of paths, does that mean then that a path with larger edge weights is longer than one with smaller edge weights?



On Mon, Nov 25, 2013 at 12:25 PM, Gábor Csárdi <address@hidden> wrote:
On Mon, Nov 25, 2013 at 3:12 PM, EthanK Gough <address@hidden> wrote:
> How does igraph handle edge weights when using edge.betweenness and
> shortest.paths? Does it simply add the edge weights when calculating the
> lengths of paths and finding geodesics?

It does exactly that.


> Thanks
> Ethan
> _______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help

reply via email to

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