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
