数据结构哈夫曼编码(源代码).docVIP

#includestdio.h #includestdlib.h #includemath.h #includestring.h #defineN1000 charkind[N]={\0}; intnum[N]={0}; intcount=0; ints1,s2; typedefstruct { intweight;/*字符权重*/ intparent,lchild,rchild; }HTNode,*HuffmanTree;/*定义哈夫曼树结点*/ typedefchar**HuffmanCode; structcharcode { chardata; charcode[20]; }Code[N],d[N],e[N]; voidCreat_message( )/*输入字符并存入文件*/ { FILE*fp; charc; if((fp=fopen(文本文件.txt,wb))==NULL) { printf(cannotopenthisfile!\n); return; } printf(请输入原代码，以#表示结束\n); do{ scanf(%c,c); fputc(c,fp); }while(c!=#); fclose(fp); } voidCalculate( )/*计算文件中字符的权值*/ { charc; inti=1,k; FILE*fp; if((fp=fopen(文本文件.txt,rb))==NULL){ printf(cannotopenthisfile\n); return; } c=fgetc(fp); while(c!=#){ for(k=0;ki;k++) if(c==kind[k]){ num[k]++;break;} if(k=ikind[k-1]!=c){ kind[i]=c;num[i]++;i++; } c=fgetc(fp); } count=i-1; } voidselect(HuffmanTreeHu,intj)/*找寻输入的字符数据中权值最小的两个结点*/ { intk=1,t; while(Hu[k].parent!=0)k++; for(t=k;t=j;t++) if(Hu[t].parent==0Hu[t].weightHu[k].weight) k=t; s1=k; k=1; while(Hu[k].parent!=0||k==s1)k++; for(t=k;t=j;t++) if(Hu[t].weightHu[k].weightHu[t].parent==0t!=s1) k=t; s2=k; } voidHuffmanCoding( )/*建立哈夫曼树并编码*/ { voidselect(HuffmanTreeHu,intj); HuffmanTreeHT; HuffmanCodeHC; intm,i,start,f,c; char*cd; FILE*fp; if(count=1)return; m=2*count-1; HT=(HuffmanTree)malloc((m+1)*sizeof(HTNode)); for(i=1;i=count;i++) HT[i].weight=num[i]; for(i=1;i=m;i++){ HT[i].parent=0; HT[i].lchild=0; HT[i].rchild=0;} for(i=count+1;i=m;i++){ select(HT,i-1); HT[s1].parent=i;HT[s2].parent=i; HT[i].lchild=s1;HT[i].rchild=s2; HT[i].weight=HT[s1].weight+HT[s2].weight;} HC=(HuffmanCode)malloc((count+1)*sizeof(char*)); cd=(char*)malloc(count*sizeof(char)); cd[count-1]=\0; for(i=1;i=count;i++){ start=count-1; for(c=i,f=HT[i].parent;f!=0;c=f,f=HT[f].parent) if(HT[f].lchild==c)cd[--start]=0; elsecd[--start]=1; HC[i]=(char*)malloc((count-start)*sizeof(char)); strcpy(HC[i],cd[start]);} if((fp=fopen(字符代码.txt,wb))==NULL) { printf(cannotopenthisfile\n); return; } for(i=1;i=count;i++){ Code[i].data=kind[i]; s