Is there any way we can integrate the generalized modularity into the current implementation of

networkx.algorithms.community.quality
networkx.algorithms.community.modularity_max

The definition of the generalized modularity is just a simple extension of modularity with one extra \gamma parameter. And it can easily improve the resolution limit of modularity-based community detection.

S

steps to reproduce

Write a loop, from 1 to 80000, each time add a random int to the max heap.

In theory it takes very little time(NlogN, N=80000, <1sec ), but the program does take a long time.

I'v also tested the BinaryHeap in https://github.com/SolutionsDesign/Algorithmia, it performs well, so it is probably due to the bad algorithm.

There are multiple graph generators that currently do not check their input for validity.

These need to be fixed:

• callaway_traits_game
• establishment_game

The following functions have been verified to check their arguments properly:

forest_fire_game

Please update the lists above as you verify functions or find new ones with problems.

This is marked as

It would be handy for all edge operations to have both f(g, e) and f(g, src(e), dst(e)) defined by default on abstract graphs