Begin with the disjoint clustering implied by threshold graph G(0),
which contains no edges and which places every object in a unique cluster, as the current clustering. Set k = 1.
Step 2
From threshold graph G(k).
If the number of components (maximally connected subgraphs) in G(k) is less than the number of clusters in the current clustering, redefine the current clustering by naming each component of G(k) as a cluster.
Step 3
If G(k) consists of a single connected graph, stop. Else, set k = k + 1 and go to step 2.
