The input should be a categorized graph’s table by clustering algorithm such as louvain. The result is a renumbered table which shows the number of vertices. The order of the result is the same as the order of input pairs.