[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 algorithm as defined in the paper　Uncovering the overlapping community structure of complex networks in nature and society - G. Palla, I. Derényi, I. Farkas, and T. Vicsek- Nature 435, 814–818 (2005)