Re: [igraph] Clique Percolation Algorithm

[Gábor Csárdi]

No plans for that, although there is an open issue:
https://github.com/igraph/igraph/issues/261

You can just download the original implementation by the authors, it
is supposed to be fast.

Gabor

On Thu, Dec 5, 2013 at 2:07 PM, EthanK Gough <address@hidden> wrote:
> 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.
>
> thanks!
>
>
> 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?
>>
>> thanks
>>
>> Ethan
>>
>>
>> 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.
>>>
>>> Gabor
>>>
>>> > Thanks
>>> >
>>> > Ethan
>>> >
>>> > _______________________________________________
>>> > igraph-help mailing list
>>> > address@hidden
>>> > https://lists.nongnu.org/mailman/listinfo/igraph-help
>>> >
>>
>>
>>
>
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help
>