In this work we propose a new efficient algorithm for communities construction based on the idea that a community is animated by a set of leaders that are followed by a set of nodes. A node can follow different leaders animating different communities. The algorithm is structured into two mains steps: identifying nodes in the network playing the role of leaders, then assigning other nodes to some leaders. We provide a general framework for implementing such an approach. First experimental results obtained by applying the algorithm on different real networks show the effectiveness of the proposed approach.