算法之并查集 C语言实现3

头文件 UnionFind3.h

#ifndef UNIONFIND3_H_INCLUDED
#define UNIONFIND3_H_INCLUDED
#include "stdlib.h"
#include "ASSERT.h"
typedef struct{
    int* parent;
    int* rank;//rank[i]表示以i为根的集合中树的层数
    int count;
}Union;

void unionFind3Init(Union *un,int n);
void freeUnion3(Union *un);
int unionFind3(Union *un,int p);
int isConnected3(Union *un,int p,int q);
void unionElements3(Union *un,int p,int q);
#endif // UNIONFIND_H_INCLUDED

c代码 UnionFind3.c

#include "UnionFind3.h"
/*********************************************
*函数名：并查集的初始化
*********************************************/
void unionFind3Init(Union *un,int n){
    int i;
    un->count = n;
    un->parent = (int*)malloc(n*sizeof(int));
    un->rank = (int*)malloc(n*sizeof(int));
    for(i=0;i<n;i++){
        un->parent[i] = i;
        un->rank[i] = 1;
    }
}
/****