#

Note

This documents the development version of NetworkX. Documentation for the current release can be found here.

#

networkx.algorithms.community.modularity_max._naive_greedy_modularity_communities

_naive_greedy_modularity_communities(G)

Find communities in graph using the greedy modularity maximization. This implementation is O(n^4), much slower than alternatives, but it is provided as an easy-to-understand reference implementation.