test_unionfind_collapse_cluster_ids()

static void test_unionfind_collapse_cluster_ids ( void  )

static

Definition at line 113 of file cu_unionfind.c.

{
        UNIONFIND* uf = UF_create(10);
 
        uf->clusters[0] = 8;
        uf->clusters[1] = 5;
        uf->clusters[2] = 5;
        uf->clusters[3] = 5;
        uf->clusters[4] = 7;
        uf->clusters[5] = 5;
        uf->clusters[6] = 8;
        uf->clusters[7] = 7;
        uf->clusters[8] = 8;
        uf->clusters[9] = 7;
 
        uf->cluster_sizes[0] = 3;
        uf->cluster_sizes[1] = 4;
        uf->cluster_sizes[2] = 4;
        uf->cluster_sizes[3] = 4;
        uf->cluster_sizes[4] = 3;
        uf->cluster_sizes[5] = 4;
        uf->cluster_sizes[6] = 3;
        uf->cluster_sizes[7] = 3;
        uf->cluster_sizes[8] = 3;
        uf->cluster_sizes[9] = 3;
 
        /* 5 -> 0
         * 7 -> 1
         * 8 -> 2
         */
        uint32_t expected_collapsed_ids[] = { 2, 0, 0, 0, 1, 0, 2, 1, 2, 1 };
        uint32_t* collapsed_ids = UF_get_collapsed_cluster_ids(uf, NULL);
 
        ASSERT_INTARRAY_EQUAL(collapsed_ids, expected_collapsed_ids, 10);
 
        lwfree(collapsed_ids);
 
        char is_in_cluster[] = { 0, 1, 1, 1, 0, 1, 0, 0, 0, 0 };
        uint32_t expected_collapsed_ids2[] = { 8, 0, 0, 0, 7, 0, 8, 7, 8, 7 };
 
        collapsed_ids = UF_get_collapsed_cluster_ids(uf, is_in_cluster);
        uint32_t i;
        for (i = 0; i < uf->N; i++)
        {
                if (is_in_cluster[i])
                        ASSERT_INT_EQUAL(expected_collapsed_ids2[i], collapsed_ids[i]);
        }
 
        lwfree(collapsed_ids);
        UF_destroy(uf);
}

References ASSERT_INT_EQUAL, ASSERT_INTARRAY_EQUAL, UNIONFIND::cluster_sizes, UNIONFIND::clusters, lwfree(), UNIONFIND::N, UF_create(), UF_destroy(), and UF_get_collapsed_cluster_ids().

Referenced by unionfind_suite_setup().

Here is the call graph for this function:

Here is the caller graph for this function: