UF_union()

void UF_union	(	UNIONFIND *	uf,
		uint32_t	i,
		uint32_t	j
	)

Definition at line 85 of file lwunionfind.c.

{
        uint32_t a = UF_find(uf, i);
        uint32_t b = UF_find(uf, j);
 
        if (a == b)
        {
                return;
        }
 
        if (uf->cluster_sizes[a] < uf->cluster_sizes[b] ||
                (uf->cluster_sizes[a] == uf->cluster_sizes[b] && a > b))
        {
                uf->clusters[a] = uf->clusters[b];
                uf->cluster_sizes[b] += uf->cluster_sizes[a];
                uf->cluster_sizes[a] = 0;
        }
        else
        {
                uf->clusters[b] = uf->clusters[a];
                uf->cluster_sizes[a] += uf->cluster_sizes[b];
                uf->cluster_sizes[b] = 0;
        }
 
        uf->num_clusters--;
}

References UNIONFIND::cluster_sizes, UNIONFIND::clusters, UNIONFIND::num_clusters, and UF_find().

Referenced by test_unionfind_union(), union_dbscan_minpoints_1(), union_if_available(), and union_intersecting_pairs().

Here is the call graph for this function:

Here is the caller graph for this function: