Closed ivan-marroquin closed 3 years ago
I found the answer in the documentation:
n_iterations (int) – Number of iterations to run the Leiden algorithm. By default, 2 iterations are run. If the number of iterations is negative, the Leiden algorithm is run until an iteration in which there was no improvement.
Sorry for the inconvenience
Ivan
Hi,
Thanks for making available such great package!
I am using Python 3.6.5 with leidenalg 0.8.4. I was wondering if it could be possible to add a parameter to function 'find_partition' that will stop the search given a number of iterations as soon as an optimised partition was found earlier. I think that such parameter could save time as unnecessary search steps are avoided.
Best regards, Ivan