Why does cluster_edge_betweenness take a long time to work and does not output a result for a network with 16,000 nodes and 300,000 links?
Is it mistake?
A straightforward implementation of the Girvan-Newman algorithm has quadratic complexity in the number of edges, therefore it is not a surprise that it is slow on such a large graph.
1 Like