Input: A set of n Test Cases, T_i, an ordered set of Clustered, C_K

Output: Clusters of Test Cases, C, Comparison Coverage Matrix Generator, M’

let T_i ε T be the i^th test cases

Form n clusters, each with one test case T_i

C ← {}

Add clusters to C

Identify clusters C_K with minimum distances from parent node to child node

For i = 1 to i ≤ n

M [i, i] = 1 (1 ≤ i ≤ n)

M [j, j] = 1 (1 ≤ j ≤ n)

M’ (i, j) = (M (i, j)/Σ_{i ≤ k ≤ n}M (i, k))*PS