Girvan and Newman algorithm for community detection

Hi everyone,
Is the command “g.community_edge_betweenness(clusters=n_clusters)” Girvan and Newman(GN) method?
If the answer is yes so, how I can get the edge_betweenness values thorough any step not only the first step?

When in doubt, check the documentation of igraph’s C core:

It has a reference to the Girvan & Newman paper.

This is implemented in the C core, but not currently exposed in the Python interface. Feel free to open a feature request and request that this information be exposed: Sign in to GitHub · GitHub