Hello
I need to solve the following problem and would like to know how can I do it using the igraph library. Given a graph and after running the algorithm were obtained infomap "n" communities. I need to determine which vertices of each community are detected vertices "boundary" (vertices are those in which the number of edges inter clusters is greater than the number of intra clusters edges), for example, given a vertex V1 with 10 edges belongs to the community C1, 7 of them are with vertices that are located in other communities and 3 are edges that are connected to vertices belonging to C1. How to find these vertices?
Thank you