Detection of communities in directed networks based on strongly p-connected components

A lot of algorithms in communities detection have been proposed particularly for undirected networks. As methods to find communities in directed networks are few, our contribution is to propose a method based on strongly and unilaterally connected components, and more specifically on strongly p-connected components in directed graphs. The result is a clustering of nodes giving good results in generated graphs according to several clustering evaluation measures, and which practical time complexity remains acceptable.