Hi all, Let us assume that we have a one-dimensional array, let's say A, of complex and/or real numbers. Now, I am interested in the detection of clusters. Each cluster, if any, consists of the elements of A, which lie inside a circle with fixed radius epsilon) How can I solve this problem most efficiently in scipy. A small example would be appreciated. Thanks in advance Nils nc, nec, cl = cluster(A, epsilon) Output nc : total number of clusters nec[i] : number of elements of cluster i cl[0:sum(nec)] : elements of all clusters