re-computation of totalGraphWeight LouvainCore.louvain

[5abhim]

In LouvainCore.louvain, we compute totalGraphWeight at very first step which is nothing but 2 * sum-of-all-edges-weights. Why do we need to compute this again and again whenever we call LouvainCore.louvain from outside do-while loop. I think this graph weight is fixed because we never delete any edges nor add any edge, we just compress node (means we convert edges into self edge) which should not change totalGraphWeight?
Please let me know, if I am thinking in wrong direction.

[5abhim]

Hello Eric and others,
It would be great if you can take some time out and look at my understanding of how total-graph-weight is computed.
Thanks in advance.

[eric-kimbrel]

In our implementation we are counting only links between nodes, and ignoring self loops. Therefore we must count the weight of these links each time the graph is compressed to change the network topology. This is my understanding of the original algorithm from the inspiring paper:

"Fast unfolding of communities in large networks Vincent D. Blondel, Jean-Loup Guillaume, Renaud Lambiotte, Etienne Lefebvre"

Its likely that our implementation is not optimal and could be imporoved , but we have had good results with this method.

Perhaps we could use a variable name like "totalLinkWeight" instead to be more clear.