[igraph] trying to understand edge betweeness community detection implemented in igraph (re-send)

[Enzo Tagliazucchi]

 (sorry for duplicate!)

Hi all Igraphers,

I'm trying to get a grasp of the community detection algorithms implemented in igraph, focusing in Girvan-Newman. Unfortunately, I'm getting nowhere. I'm working (as you'd probably guess) with Zachary Karate Club graph to test my results.

My first and most fundamental question will be: what is the format of the membership vector? If a have 34 nodes, I expect to find a list of 34 numbers which would be the list of the 34  nodes components ID? Is the merging from leaf nodes to bigger clusters or in reverse?

I couldn't find much help in the igraph documentation , so any help will be greatly appreciated!

Enzo