Dear Davide,

You can take a look at the git commit history for all the gritty details, but in a nutshell:

- The agglomeration algorithm has been moved entirely to C++ (some higher level functions were in Python before) - Many data structures have been improved (e.g. the bookkeeping necessary for move proposals) - The initialization of the agglomeration has been changed: when starting with B=N groups, instead of performing merge/sweeps, we just do single-node sweeps, which have the same effect as merges, but are much faster. Only after the number of groups stops decreasing fast enough, we switch to merges.

The last modification turned out to have a big relative impact in practice.

Best,
Tiago

Am 09.07.21 um 09:15 schrieb Davide Cittaro:
Nevermind, after further investigations I found that the degradation was only 
apparent. Still, I'd like to know which are the optimizations that have been 
included and what do they affect
_______________________________________________
graph-tool mailing list -- [email protected]
To unsubscribe send an email to [email protected]



--
Tiago de Paula Peixoto <[email protected]>
_______________________________________________
graph-tool mailing list -- [email protected]
To unsubscribe send an email to [email protected]

Reply via email to