54{
55 uint32_t final_clusters[] = { 0, 2, 2, 2, 4, 5, 6, 0, 0, 2 };
56 uint32_t final_sizes[] = { 3, 0, 4, 0, 1, 1, 1, 0, 0, 0 };
57
58
60 {
62 .num_clusters = 5,
63 .clusters = final_clusters,
64 .cluster_sizes = final_sizes
65 };
66
68
69 char encountered_cluster[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
70
71 uint32_t i;
72 for (i = 0; i < uf.
N; i++)
73 {
74 uint32_t c = final_clusters[ids_by_cluster[i]];
75 if (!encountered_cluster[c])
76 {
77 encountered_cluster[c] = 1;
78 }
79 else
80 {
81
82
83 uint32_t c_prev = final_clusters[ids_by_cluster[i-1]];
84 CU_ASSERT_EQUAL(c, c_prev);
85 }
86 }
88}
uint32_t * UF_ordered_by_cluster(UNIONFIND *uf)