问题补充说明：哈夫曼编码算法.完成huffman函数,实现哈夫曼树的构建算法,并根据main函数中黑体字的要求完成main函数.... 哈夫曼编码算法.完成huffman函数,实现哈夫曼树的构建算法,并根据main函数中黑体字的要求完成main函数. 展开
1234567891011121314151617181920212223242526272829360问答3031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989木兰基落练序九工910010110210项重委310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014基抗甲11421431441451461471481491罗此年能50151152153154155156157158159160161162163164165166167168169170171172173174其挥一乐略响主1751761771781791801811械具斤游么汽还练请查821831841851基端86187188189/*----------感当互生才发论诗-----------------------------马身念兰黄------------------------减钢点织么---------- * Name: 哈夫曼编码源代码。 * Date: 2011.04.16 * Author: Jeffre序查取结则以计密坐轴吸y Hill+Jezze(解码部分) * 在 Win-TC 下测试坏格定害判针发罗通过 * 实现过程：着先通过 Huffma零连黑nTree() 函数构造哈众坚除毛蒸歌夫曼树，然后在主函数 main()声属村中 * 自跑运印销渐盾验底向上开始(也就是从钱掌资儿感积九连数组序号为零的结点开始)向上层层判断，若在 * 父结点左侧，则置码为 0,若在右侧,则置码为 1。最后输出生成的编码。 *------世印玉决赶思异------------------------------------------------------------------*/#include <stdio.h>#include<stdlib.h> #define MAXBIT 100#define MAXVALUE 10000#define MAXLEAF 30#define MAXNODE MAXLEAF*2 -1 typedef struct { int bit[MAXBIT]; int start;} HCodeType; /* 编码结构体 */typedef struct{ int weight; int parent; int lchild; int rchild; int value;} HNodeType; /* 结点结构体 */ /* 构造一颗哈夫曼树 */void HuffmanTree (HNodeType HuffNode[MAXNODE], int n){ /* i、j： 循环变量，m1、m2：构造哈夫曼树不同过程中两个最小权值结点的权值， x1、x2：构造哈夫曼树不同过程中两个最小权值结点在数组中的序号。*/ int i, j, m1, m2, x1, x2; /* 初始化存放哈夫曼树数组 HuffNode[] 中的结点 */ for (i=0; i<2*n-1; i++) { HuffNode[i].weight = 0;//权值 HuffNode[i].parent =-1; HuffNode[i].lchild =-1; HuffNode[i].rchild =-1; HuffNode[i].value=i; //实际值，可根据情况替换为字母 } /* end for */ /* 输入 n 个叶子结点的权值 */ for (i=0; i<n; i++) { printf ("Please input weight of leaf node %d: \n", i); scanf ("%d", &HuffNode[i].weight); } /* end for */ /* 循环构造 Huffman 树 */ for (i=0; i<n-1; i++) { m1=m2=MAXVALUE; /* m1、m2中存放两个无父结点且结点权值最小的两个结点 */ x1=x2=0; /* 找出所有结点中权值最小、无父结点的两个结点，并合并之为一颗二叉树 */ for (j=0; j<n+i; j++) { if (HuffNode[j].weight < m1 && HuffNode[j].parent==-1) { m2=m1; x2=x1; m1=HuffNode[j].weight; x1=j; } else if (HuffNode[j].weight < m2 && HuffNode[j].parent==-1) { m2=HuffNode[j].weight; x2=j; } } /* end for */ /* 设置找到的两个子结点 x1、x2 的父结点信息 */ HuffNode[x1].parent = n+i; HuffNode[x2].parent = n+i; HuffNode[n+i].weight = HuffNode[x1].weight + HuffNode[x2].weight; HuffNode[n+i].lchild = x1; HuffNode[n+i].rchild = x2; printf ("x1.weight and x2.weight in round %d: %d, %d\n", i+1, HuffNode[x1].weight, HuffNode[x2].weight); /* 用于测试 */ printf ("\n"); } /* end for */ /* for(i=0;i<n+2;i++) { printf(" Parents:%d,lchild:%d,rchild:%d,value:%d,weight:%d\n",HuffNode[i].parent,HuffNode[i].lchild,HuffNode[i].rchild,HuffNode[i].value,HuffNode[i].weight); }*///测试 } /* end HuffmanTree */ //解码 void decodeing(char string[],HNodeType Buf[],int Num){ int i,tmp=0,code[1024]; int m=2*Num-1; char *nump; char num[1024]; for(i=0;i<strlen(string);i++) { if(string[i]=='0') num[i]=0; else num[i]=1; } i=0; nump=&num[0]; while(nump<(&num[strlen(string)])) {tmp=m-1; while((Buf[tmp].lchild!=-1)&&(Buf[tmp].rchild!=-1)) { if(*nump==0) { tmp=Buf[tmp].lchild ; } else tmp=Buf[tmp].rchild; nump++; } printf("%d",Buf[tmp].value); } } int main(void){ HNodeType HuffNode[MAXNODE]; /* 定义一个结点结构体数组 */ HCodeType HuffCode[MAXLEAF], cd; /* 定义一个编码结构体数组， 同时定义一个临时变量来存放求解编码时的信息 */ int i, j, c, p, n; char pp[100]; printf ("Please input n:\n"); scanf ("%d", &n); HuffmanTree (HuffNode, n); for (i=0; i < n; i++) { cd.start = n-1; c = i; p = HuffNode[c].parent; while (p != -1) /* 父结点存在 */ { if (HuffNode[p].lchild == c) cd.bit[cd.start] = 0; else cd.bit[cd.start] = 1; cd.start--; /* 求编码的低一位 */ c=p; p=HuffNode[c].parent; /* 设置下一循环条件 */ } /* end while */ /* 保存求出的每个叶结点的哈夫曼编码和编码的起始位 */ for (j=cd.start+1; j<n; j++) { HuffCode[i].bit[j] = cd.bit[j];} HuffCode[i].start = cd.start; } /* end for */ /* 输出已保存好的所有存在编码的哈夫曼编码 */ for (i=0; i<n; i++) { printf ("%d 's Huffman code is: ", i); for (j=HuffCode[i].start+1; j < n; j++) { printf ("%d", HuffCode[i].bit[j]); } printf(" start:%d",HuffCode[i].start); printf ("\n"); }/* for(i=0;i<n;i++){ for(j=0;j<n;j++) { printf ("%d", HuffCode[i].bit[j]); } printf("\n"); }*/ printf("Decoding?Please Enter code:\n"); scanf("%s",&pp);decodeing(pp,HuffNode,n); getch(); return 0;}
http://www.***.com/Jezze/archive/2011/12/23/2299884.html
标签：哈夫曼,算法,构造
