search

vtraag / leidenalg

Implementation of the Leiden algorithm for various quality functions to be used with igraph in Python.
GNU General Public License v3.0
596 stars 78 forks source link

Simplified for-loops, made fixed membership more efficient/clear #45

Closed vtraag closed 4 years ago

vtraag commented 4 years ago

All loops are simplified using range-based for-loops (only supported in C++11) where possible.

Some of the types were changed a bit, the set container was completely removed everywhere.

Additionally, some aspects around fixed membership are clarified (as identified in #43), making the terminology a bit more clear, and also making the implementation slightly faster.