[igraph] community detection

[zhengjun chen]

Hi,

I run "fastgreedy" community detection algorithm. I get the "merges" and "modularity".
Then I use igraph_community_to_membership () to create a membership vector from a community structure dendrogram.

My question is how to fill the parameter steps in this function. Right now I use the value corresponding largest modularity. 

I find that there are several largest modularity values in my case. In other words, several steps have the same modularity.

They do not have the same resulting membership. So, which steps I should choose?

--
Thanks
zhengjun