# Graph clustering

### Description
Given a list pairs which represent a sub-graph of nodes:
- compute the closure of connected nodes (up to the specified number of iterations)
- identify disjoint clusters (graph cliques).

### Input
- `LINKS [OBJ,OBJ]`: a list of links

### Output
- `RESULT [OBJ,OBJ]`: the clustered graph. Column 1 is a node that represents the cluster it belongs to. Column 2 is one of the graph nodes.
- `GROUPS [INTEGER,OBJ]`: the clustered graph. Column 1 is an integer identifier that represents a cluster. Column 2 is one of the graph nodes.

### Parameters
- `Max number of iterations`: when to stop computation of graph closure if it hasn't converged yet