Graph Clustering
Description
Given is a list of 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 has not converged yet.