Clustering on graph data is one of the popular clustering techniques in the field of Graph mining. An accurate and fast clustering algorithm which attains high quality clusters in comparison with traditional data-mining or graph mining clustering-algorithms is Affinitypropagation (A-P). A large part of the real-world data falls under complex networks enhancing its applicability to wide sectors of research in computer science. In this paper, we consider a real-world complex infrastructure network, Water Distribution Network (WDN), consisting of node properties namely elevation, base demand, head, pressure and demand and the edge properties flow, velocity, roughness, length, diameter, friction factor and unit head loss. A-P algorithm initially develops a similarity-matrix by using data points of the real-world dataset. Secondly, responsibility and availability matrices are developed iteratively until constant responsibility and availability values are obtained. This is performed by using vectorized implementation. Finally, criterion matrix is developed as the sum of responsibility and availability to generate cluster centers. The WDN is sparse and complex; A-P gives strong clusters with potential cluster centers with time complexity of O(N 2). In addition, data points of a cluster formed are at same geographical location. An experimental result shows the novelty of A-P on WDN.