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. El 2/6/2016 13:42, "Tamas Nepusz" <[email protected]> escribió:
Hello, Can you send us a graph that reproduces this behaviour? T. On Thu, Jun 2, 2016 at 1:31 PM, Kuu <[email protected]> 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 > [email protected] > https://lists.nongnu.org/mailman/listinfo/igraph-help > _______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
_______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
