Hello,
I would like your help to solve the following problem, using the Infomap 
communities detection algorithm:
Suppose that after the execution of the algorithm, four communities have been 
reported, for example, the first three community has vertices, second 6, third 
8 and the fourth second.
I want to know, how do I access the 3 vertices (nodes) contained within the 
community 1 to then access their labels of the vertices belonging to the same 
community.
Example: Community 1 => V1, V2 and V3
labels:
V1 = 1;V2 = 1;V3 = 2;

Thank you
                                          
_______________________________________________
igraph-help mailing list
[email protected]
https://lists.nongnu.org/mailman/listinfo/igraph-help

Reply via email to