Board logo

标题: 不相交集的求并算法（按集合大小求并+按高度求并）（2） [打印本页]
作者: yuyang911220    时间: 2016-8-20 19:43     标题: 不相交集的求并算法（按集合大小求并+按高度求并）（2）


  • 1.6.3）printing result
【2】灵巧求并算法——按集合高度求并2.1）按高度求并定义： 另外一种方法是按照高度求并（按照高度求并是按大小求并的简单修改）（推荐）；
2.2）它同样保证所有的树的深入最多是 O（logN)。我们使得 浅的树 成为深 的树的子树，这是一种平缓算法， 因为只有当两颗相等深度的树求并时树的高度才会增加（此时树的高度增加1）。
2.3）source code + printing result
#include <stdio.h>#include <malloc.h>#define ElementType int#define Error(str) printf("\n error: %s \n",str) struct UnionSet;typedef struct UnionSet* UnionSet;// we adopt the depth-sibling exprstruct UnionSet{    int parent;    int height;    ElementType value;};UnionSet makeEmpty();UnionSet* initUnionSet(int depth, ElementType* data);void printSet(UnionSet* set, int depth);void printArray(ElementType data[], int depth);int find(ElementType index, UnionSet* set);// initialize the union set UnionSet* initUnionSet(int size, ElementType* data){    UnionSet* set;      int i;    set = (UnionSet*)malloc(size * sizeof(UnionSet));    if(!set)    {        Error("out of space, from func initUnionSet");                return NULL;    }       for(i=0; i<size; i++)    {        set = makeEmpty();        if(!set)            return NULL;        set->value = data;    }        return set;}// allocate the memory for the single UnionSet and evaluate the parent and depth -1UnionSet makeEmpty(){    UnionSet temp;    temp = (UnionSet)malloc(sizeof(struct UnionSet));    if(!temp)    {        Error("out of space, from func makeEmpty!");                return NULL;    }    temp->parent = -1;    temp->height = 0;    return temp;}// merge set1 and set2 by depthvoid setUnion(UnionSet* set, int index1, int index2){    //judge whether the index1 or index2 equals to -1 ,also -1 represents the root    if(index1 != -1)        index1 = find(index1, set);    if(index2 != -1)        index2 = find(index2, set);    if(set[index1]->height > set[index2]->height)           set[index2]->parent = index1;               else if(set[index1]->height < set[index2]->height)          set[index1]->parent = index2;           else    {        set[index1]->parent = index2;        set[index2]->height++; // only if the height of both of subtrees is equal, the height increases one    }} //find the root of one set whose value equals to given valueint find(ElementType index, UnionSet* set) {    UnionSet temp;          while(1)    {        temp = set[index];        if(temp->parent == -1)            break;        index = temp->parent;    }    return index;       }   int main(){    int size;    UnionSet* unionSet;    ElementType data[] = {110, 245, 895, 658, 321, 852, 147, 458, 469, 159, 347, 28};    size = 12;    printf("\n\t====== test for union set by depth ======\n");    //printf("\n\t=== the initial array is as follows ===\n");    //printArray(data, depth);         printf("\n\t=== the init union set are as follows ===\n");    unionSet = initUnionSet(size, data); // initialize the union set over    printSet(unionSet, size);        printf("\n\t=== after union(0, 1) + union(2, 3) + union(4, 5) + union(6, 7) + union(8, 9) + union(10 ,11) ===\n");    setUnion(unionSet, 0, 1);    setUnion(unionSet, 2, 3);    setUnion(unionSet, 4, 5);    setUnion(unionSet, 6, 7);    setUnion(unionSet, 8, 9);       setUnion(unionSet, 10, 11);     printSet(unionSet, size);    printf("\n\t=== after union(1, 3) + union(5, 7) + union(9, 11) ===\n");    setUnion(unionSet, 1, 3);    setUnion(unionSet, 5, 7);    setUnion(unionSet, 9, 11);    printSet(unionSet, size);          printf("\n\t=== after union(3, 7) + union(7, 11) ===\n");    setUnion(unionSet, 3, 7);    setUnion(unionSet, 7, 11);      printSet(unionSet, size);     return 0;}void printArray(ElementType data[], int size){    int i;    for(i = 0; i < size; i++)            printf("\n\t data[%d] = %d", i, data);                        printf("\n\n");} void printSet(UnionSet* set, int size){    int i;    UnionSet temp;        for(i = 0; i < size; i++)    {               temp = set;        printf("\n\t parent[%d] = %d", i, temp->parent);                    }    printf("\n");}
作者: yuchengze    时间: 2016-8-21 12:26

很好的算法的分享，感谢楼主，路过帮顶



欢迎光临 电子技术论坛_中国专业的电子工程师学习交流社区-中电网技术论坛 (http://bbs.eccn.com/) Powered by Discuz! 7.0.0