[X,Y,Z] = k_clique(k,A) Inputs: k - clique size A - adjacency matrix Outputs: X - detected communities Y - all cliques (i.e. complete subgraphs that are not parts of larger complete subgraphs) Z - k-clique matrix-k-clique alg

这是2014年在自然杂志上发表的密度峰聚类的代码-This is 2014 in Nature magazine published the density peak clustering code