> I know that the algorithm is not deterministic. In my case, the graph only > have tens of nodes, while the results are very different. > In igraph, the unweighted version results in only one community; in SNAP, > there are quite a few communities.
How does SNAP select the number of communities for the edge betweenness method? This is not specified in the original algorithm; igraph just cuts the community dendrogram at the point where the modularity is maximal. Is it the same for SNAP? Cheers, T. _______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
