Clique Percolation Method

This new release brings new features.

1. The ability to parallelise. The identification of communities in large and dense networks can require a long computational time. It is now possible to set the number of workers that will speed up the process.

2. The ability to display communities based on vertices attributes. For instance, if vertices have names, it becomes easier to check and compare communities by vertices names rather than vertices id.

Clique Percolation Method

Clique Percolation Method (CPM) is an algorithm for finding overlapping communities within networks, intruduced by Palla et al. (2005, see references). This implementation in Python, firstly detects communities of size k, then creates a clique graph. Each community will be represented by each connected component in the clique graph.