Re: [igraph] Choosing between different methods of detecting communities

[Tamás Nepusz]

> I am not sure, because the results are different from the same algorithm in 
> SNAP, which also implement Girvan-Newman's algorithm while only unweighted 
> version.

The edge betweenness algorithm is not deterministic in the sense that it is 
free to make a (possibly random) choice when there are two or more edges with 
the same edge betweenness. Therefore, it is not guaranteed that different 
implementations give exactly the same results, unless there are no ties in edge 
betweenness values throughout the course of the algorithm.

-- 
T.