community.py

# Import the packages
import community
from importlib import reload
# reload(community)
# or use Girvan-Newman algorithm
# Assgin the community function to c_values
communities = community.best_partition(G.to_undirected(), resolution = .75)
c_values = [communities.get(node) for node in G.nodes()]

# Plot the the graph again with community using c_values as color
plt.figure(figsize=(22,16))
nx.draw(G, edge_color = '#ced7d9',width = 4, arrowsize = 30, node_color = c_values,  with_labels= True)