|
From: | Kuu |
Subject: | Re: [igraph] Doubts with community multilevel Python algorithm |
Date: | Thu, 2 Jun 2016 13:53:12 +0200 |
Unfortunately I work with sensible data and I don't have the option to extract information from my PC (I don't even have internet connection, this is sent from my smart phone), so I can not send it to you.
Hello,
Can you send us a graph that reproduces this behaviour?
T.
> _______________________________________________
On Thu, Jun 2, 2016 at 1:31 PM, Kuu <address@hidden> wrote:
> Hello,
>
> I have a graph that has disconnected components and I want to find
> communities over it. I'm applying directly the community multilevel
> algorithm, but I'm obtaining communities that aren't connected, which from
> my point of view, those shouldn't be considered as a valid community.
>
> Should I run the algorithm only over connected components?? By reading the
> original paper I understand that only two communities are merged if they're
> connected, but maybe I'm not understanding it correctly.
>
> Thanks for your help.
>
> Regards,
> Javier
>
>
> 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
[Prev in Thread] | Current Thread | [Next in Thread] |