哈弗曼编码译码器

注释非常详细，希望对你有所帮助！
#ifndef Huffman_Tree_h
#define Huffman_Tree_h
#endif

#include

typedef struct {
unsigned int weight;
unsigned int parent,lchild,rchild;
}HTNode, * HuffmanTree; //存储赫夫曼树的结点类型

typedef char * * HuffmanCode; //用于存储字符集中各个字符相应的赫夫曼编码

void strcpy(char *S1,char *S2){ //将字符串S2复制到S1
int i = 0;
while( S2[i] != '\0' ){
S1[i] = S2[i];
i++;
}
S1[i] = '\0';
}

void Select(HuffmanTree HT,int t,int &s1,int &s2){ //在HT[1]到HT[t-1]中找出权值最小的两个S1和S2
int i = 1;
s1 = s2 = 0;
HT[0].weight = 65535;
while( i <= t ){ //遍历查找权值最小的结点S1
if( HT[i].parent == 0 && HT[i].weight < HT[s1].weight )
s1 = i;
i++;
}
i = 1;
while( i <= t ){ //遍历查找除S1外权值最小的结点S2
if( i != s1 && HT[i].parent == 0 && HT[i].weight < HT[s2].weight )
s2 = i;
i++;
}
}

int HuffmanCoding( HuffmanTree &HT,HuffmanCode &HC,int *w,int n){ //根据各个字符的权值构造赫夫曼树HT，将对应的赫夫曼编码存储在HC中
int s1,s2,m,i,start;
unsigned int c,f;
HTNode * p;
char *cd;
if( n <= 1 ) return 0;
m = 2 * n - 1; //赫夫曼树的总结点树为m
HT = (HuffmanTree)malloc((m + 1) * sizeof(HTNode)); //申请存储赫夫曼树的空间
for(p = HT + 1, i = 1; i <= n; ++i, ++p, ++w){ //将各个叶子结点的weight赋以相应的权值，parent,lchild,rchild均赋为0
p->weight = *(w+1);
p->parent = p->lchild = p->rchild = 0;
}
for( ; i <= m; ++i, ++p ){ //将各个非叶子结点的weight,parent,lchild,rchild均赋为0
p->weight = p->parent = p->lchild = p->rchild = 0;
}
for( i = n + 1; i <= m; ++i ){ //构造赫夫曼树，给各个非叶子结点赋值
Select(HT, i - 1, s1, s2);
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((n + 1) * sizeof(char *)); //申请空间，用于存储指向存储各个字符相应赫夫曼编码的字符数组的指针
cd = (char *)malloc(n * sizeof(char)); //申请用于求赫夫曼编码
cd[n - 1] = '\0'; //编码结束符
for( i = 1; i <= n; ++i){ //逐个字符求赫夫曼编码
start = n -1; //编码在数组cd[]中的最前位置
for(c = i,f = HT[i].parent; f != 0; c = f, f = HT[f].parent) //从叶子到根逆向求编码
if(HT[f].lchild == c)
cd[ --start ] = '0';
else
cd[ --start ] = '1';
HC[i] = (char *)malloc((n - start)*sizeof(char)); //为第i个字符编码分配空间
strcpy(HC[i], &cd[start]); //将cd[]数组的start位置到n-1位置复制给HC[i]
}
free(cd); //释放空间
return 1;
}
以上为第一部分

#include
#include
#include "Huffman_Tree.h"
#define Yes 1 //当程序已经调用过初始化赫夫曼树的InitHuff_T()函数，或已从htfTree文件读取过，则将Init_Mode置为Yes，否则为No
#define No 0

void InitHuff_T( HuffmanTree &HT, HuffmanCode &HC, char ch[],int &n ){ //初始化赫夫曼数，要求用户输入字符和相应权值
int i = 1,w[100],tem,j;
char a[20];
FILE *save;
printf("请输入编码字符集的大小n:");
scanf("%d",&n); //获取用户输入的字符集个数
while( i <= n ){ //获取用户输入的字符和相应权值，分别存储在ch[]和w[]数组中
printf("请输入第%d个字符和该字符的权值w:",i);
fflush(stdin);
scanf("%c%d",&ch[i],&w[i]);
i++;
}
ch[i] = '\0';
HuffmanCoding(HT,HC,w,n); //根据用户的输入，生成赫夫曼数及各个字符相应的赫夫曼编码，分别存在HT树和HC中
if(( save = fopen("htfTree","w")) == NULL ){ //打开用于存储赫夫曼树的文件
printf("Open file fail......\n");
exit(0);
}
tem = n; //接下来的14行是将字符集大小转换成字符形式写入到文件中
j = 0;
while( tem != 0 ){
tem = tem / 10;
j++;
}
tem = n;
a[j] = '\0';
while( tem != 0 ){
a[j - 1] = (char)(tem % 10 + 48);
tem = tem / 10;
j--;
}
fputs(a,save);
printf("%d\n",n); //向屏幕输出字符集大小n
fputc('\n',save);
for( i = 1; i <= n; i++ ){ //分别向文件和屏幕输出各个字符和相应的赫夫曼编码
fputc(ch[i],save); printf("%c\t",ch[i]);
fputc('\t',save);
fputs(HC[i],save); printf("%s\n",HC[i]);
fputc('\n',save);
}
for(i = 1; i <= 2 * n - 1; i++ ){ //将赫夫曼树各个结点的parent,lchild,rchild分别写入到文件中
tem = HT[i].parent; //将i结点的parent转换成字符并写入到文件中
if(tem == 0){
fputc(tem + 48,save);
fputc(' ',save);
}
else{
j = 0;
while( tem != 0 ){
tem = tem / 10;
j++;
}
tem = HT[i].parent;
a[j] = '\0';
while( tem != 0 ){
a[j - 1] = (char)(tem % 10 + 48);
tem = tem / 10;
j--;
}
fputs(a,save);
fputc(' ',save);
}

tem = HT[i].lchild; //将i结点的lchild转换成字符并写入到文件中
if(tem == 0){
fputc(tem + 48,save);
fputc(' ',save);
}
else{
j = 0;
while( tem != 0 ){
tem = tem / 10;
j++;
}
tem = HT[i].lchild;
a[j] = '\0';
while( tem != 0 ){
a[j - 1] = (char)(tem % 10 + 48);
tem = tem / 10;
j--;
}
fputs(a,save);
fputc(' ',save);
}

tem = HT[i].rchild; //将i结点的rchild转换成字符并写入到文件中
if(tem == 0){
fputc(tem + 48,save);
fputc('\n',save);
}
else{
j = 0;
while( tem != 0 ){
tem = tem / 10;
j++;
}
tem = HT[i].rchild;
a[j] = '\0';
while( tem != 0 ){
a[j - 1] = (char)(tem % 10 + 48);
tem = tem / 10;
j--;
}
fputs(a,save);
fputc('\n',save);
}
}
fclose(save);
}

void Encoding(HuffmanTree &HT, HuffmanCode &HC, char ch[]){ //根据赫夫曼编码将用户指定的文件中的字符编成相应的编码,并将所得编码存储到用户指定文件
FILE *ToBeTran,*CodeFile;
char ToBeTran_Name[100],CodeFile_Name[100]; //存储用户指定文件的文件名
int i;
char c;
printf("请输入所要进行编码的文件的文件名:");
scanf("%s",ToBeTran_Name); //获得所要进行编码的文件的文件名
if(( ToBeTran = fopen(ToBeTran_Name,"r")) == NULL ){ //打开文件
printf("Open file fail......\n");
exit(0);
}
printf("请输入编码后编码表示的信息所存储到的文件的文件名:");
scanf("%s",CodeFile_Name); //获得编码后编码表示的信息所存储到的文件的文件名
if(( CodeFile = fopen(CodeFile_Name,"w")) == NULL ){ //打开文件
printf("Open file fail......\n");
exit(0);
}
c = fgetc(ToBeTran); //从文件读取一个字符
while( c != EOF ){ //对文件中的各个字符进行编码，直至文件结尾
i = 1;
while( c != ch[i] && ch[i] != '\0' ) //在ch[]数组中查找从文件读取的字符
i++;
if(ch[i] == '\0'){ //未找到，c不在ch[]数组中，c无法被识别，程序出错，退出
printf("字符%c无法识别，程序将退出。\n",c);
exit(0);
}
fputs(HC[i],CodeFile); //若找到，则将c相应的赫夫曼编码写入到文件中
printf("%s",HC[i]); //将c相应的赫夫曼编码输出到屏幕
c = fgetc(ToBeTran); //读入文件中的下一个字符
}
printf("\n");
fclose(ToBeTran);
fclose(CodeFile);
}

void Decoding(HuffmanTree HT, char ch[] , int n){ //对指定的存储由赫夫曼编码表示的信息的文件进行译码，翻译成相应的字符表示，并存储到指定文件
int p,i = 1;
char code[1000],c;
char CodeFile_Name[100],TextFile_Name[100]; //存储用户指定文件的文件名
p = 2 * n - 1;
FILE *CodeFile,*TextFile;
printf("请输入所要译的文件名:");
scanf("%s",CodeFile_Name); //获得所要译的文件的文件名
if(( CodeFile = fopen("CodeFile","r")) == NULL ){ //打开文件
printf("Open file fail......\n");
exit(0);
}
printf("请输入译后的字符存储到的文件的文件名:");
scanf("%s",TextFile_Name); //获得译后的字符存储到的文件的文件名
if(( TextFile = fopen(TextFile_Name,"w")) == NULL ){ //打开文件
printf("Open file fail......\n");
exit(0);
}
c = fgetc(CodeFile);
while( c != EOF ){
code[i] = c;
i++;
c = fgetc(CodeFile);
}
code[i] = '\0'; //从文件读取字符，存储在code[]数组中
i = 1;
while ( code[i] != '\0' && p != 0 ){ //对数组code[]中的赫夫曼编码进行译码
if ( code[i] == '0' )
p=HT[p].lchild; //进入左分支
else
p = HT[p].rchild; //进入右分支
if (!HT[p].lchild&& !HT[p].rchild){ //进入叶子结点
fputc(ch[p], TextFile); //将相应的字符写入到文件中
printf("%c",ch[p]); //将相应的字符输出到屏幕
p = 2 * n - 1; //重新从树根出发进行译码
}
i++;
}
printf("\n");
}

void ReadHuff_T( HuffmanTree &HT, HuffmanCode &HC, char ch[], int &n){ //从文件读取赫夫曼树
FILE *htfTree;
char c[100],ch1;
int i,j,t;
if(( htfTree = fopen("htfTree","r")) == NULL ){ //打开存有赫夫曼树信息的文件
printf("Open file fail......\n");
exit(0);
}
fgets(c,10,htfTree); //获取赫夫曼树叶子结点个数的字符串表示形式
i = 0; //以下6行将字符串形式转换成整数形式
while( c[i] != '\n' )
i++;
n = 0;
for( j = 0; j < i; j++ )
n = 10 * n + c[j] - '0'; //求出叶子结点数n
HC = (HuffmanCode)malloc((n + 1) * sizeof(char *)); //申请HC空间
HT = (HuffmanTree)malloc((2 * n) * sizeof(HTNode)); //申请赫夫曼树存储空间
i = 1;
while( i <= n ){
ch[i] = fgetc(htfTree); //读取字符集中的一个字符
HC[i] = (char *)malloc((10)*sizeof(char)); //申请用于存储读取到的字符集中的字符的赫夫曼编码的空间
fgetc(htfTree); //将‘\t’输出
ch1 = fgetc(htfTree); //读取赫夫曼编码，存储在相应的HC[i][]数组里
int j = 0;
while( ch1 != '\n' ){
HC[i][j] = ch1;
j++;
ch1 = fgetc(htfTree);
}
HC[i][j] = '\0';
i++;
}
ch[i] = '\0';
i = 0;
while( i < 2 * n - 1 ){ //读取赫夫曼树的各个结点的parent,lchild,rchild.并赋值到赫夫曼树HT中
ch1 = fgetc(htfTree); //读取parent的字符串形式,存储在c[]中，并将其转换成整数形式，赋给HT[i].parent
j = 0;
while( ch1 != ' ' ){
c[j] = ch1;
j++;
ch1 = fgetc(htfTree);
}
HT[i+1].parent = 0;
for( t = 0; t < j; t++ )
HT[i+1].parent = 10 * HT[i+1].parent + c[t] - '0';
ch1 = fgetc(htfTree); //读取lchild的字符串形式，并将其转换成整数形式，赋给HT[i].lchild
j = 0;
while( ch1 != ' ' ){
c[j] = ch1;
j++;
ch1 = fgetc(htfTree);
}
HT[i+1].lchild = 0;
for( t = 0; t < j; t++ )
HT[i+1].lchild = 10 * HT[i+1].lchild + c[t] - '0';
ch1 = fgetc(htfTree); //读取rchild的字符串形式，并将其转换成整数形式，赋给HT[i].rchild
j = 0;
while( ch1 != '\n' ){
c[j] = ch1;
j++;
ch1 = fgetc(htfTree);
}
HT[i+1].rchild = 0;
for( t = 0; t < j; t++ )
HT[i+1].rchild = 10 * HT[i+1].rchild + c[t] - '0';
i++;
}
}

int main(){
HuffmanTree HT;
HuffmanCode HC;
char ch[100]; //用于存储字符集
int n,Init_Mode = No; //n为字符集的大小，Init_Mode = No 表示内存中没有赫夫曼树的信息
char mode; //让用户选择不同的操作
printf("请输入你要选择的功能\n");
printf("\t\tI -- 初始化\t\tE -- 编码\n");
printf("\t\tD -- 译码 \t\tQ -- 退出程序\n");
scanf("%c",&mode); //获得用户选择的操作
while( mode != 'Q' && mode != 'q' ){ //当用户输入不为Q或q时，执行相应操作
switch(mode){
case 'I' :
InitHuff_T(HT,HC,ch,n);
Init_Mode = Yes;
break;
case 'i' :
InitHuff_T(HT,HC,ch,n);
Init_Mode = Yes;
break;
case 'E' :
if( No == Init_Mode )
ReadHuff_T(HT,HC,ch,n);
Encoding(HT,HC,ch);
Init_Mode = Yes;
break;
case 'e' :
if( No == Init_Mode )
ReadHuff_T(HT,HC,ch,n);
Encoding(HT,HC,ch);
Init_Mode = Yes;
break;
case 'D' :
if( No == Init_Mode )
ReadHuff_T(HT,HC,ch,n);
Decoding(HT,ch,n);
Init_Mode = Yes;
break;
case 'd' :
if( No == Init_Mode )
ReadHuff_T(HT,HC,ch,n);
Decoding(HT,ch,n);
Init_Mode = Yes;
default :
printf("您的输入有错，请重新选择.\n");
}
printf("请输入你要选择的功能\n");
printf("\tI -- 初始化\tE -- 编码\n");
printf("\tD -- 译码 \tQ -- 退出程序\n");
fflush(stdin);
scanf("%c",&mode); //让用户继续选择相应的操作，直至用户选择退出
}
return 0;
}

/*数据结构程序设计 哈夫曼编译器*/
/*班级 通工XXXX */
/*姓名 XX*/
/*班内序号 XX*/
#include "stdio.h"
#include "string.h"
#include "stdlib.h"
#define N 128
#define M 2*N-1

/*清屏函数*/
void clearscreen()
{

getchar();
system("cls");
}

typedef struct HuffmanInformation
{
int weight;
int parent;
int LChild;
int RChild;
}HTNode;
HTNode ht[M];

char hc[N];

typedef struct JieDian
{
char ch;/*记录结点字符*/
int weight;/*记录结点权值*/
char hc[20];/*记录叶子结点的编码值*/
}HF;
HF hf[128];
int top;

int ReadFile(char A[])/*读文件，读出数组A*/
{ int x,i;
char ch;
FILE *fp;
strcpy(A,"");
if((fp=fopen("c:\\original.txt","rt"))==NULL)/*打开文件*/
{
printf("文件打不开，按任意键退出\n");
getch();
exit(1);
}
for(i=0;i<10000&&!feof(fp);i++)/*feof(fp)=1说明遇文件尾*/
{
fscanf(fp,"%c",&A[i]); /*格式化读函数，从fp指向的文件中的数据送入数组A*/
printf("%c",A[i]);
} A[i-1]='\0';
x=i-2;;/*记录树组A的长度*/
printf("\n 文件中语句字符个数为X=%d\n",x);
fclose(fp);
return x;/*返回树组A长度*/
}

int Account(char A[],int x)/*统计字符出现的频度*/
{ int i,j,k,l,n;
int C[128];
l=1;
k=0;
for(i=0;i<128;i++)
C[i]=0;/*C数组记录字符频度,初始化为零*/
for(i=0;i {
j=(int)A[i];/*强制转换类型，把字符型转换成整型*/
C[j]++;
}
for(i=0;i<128;i++)
{
if(C[i]!=0)
{
hf[l].weight=C[i];
hf[l].ch=(char)i;
k++;
printf("字符%c的频度为%d\n",hf[l].ch,hf[l].weight);
l++;
}
}
n=k;
printf("\n 文件中出现叶子结点个数为 X=%d\n",k);
return n;
}

void select(HTNode ht[],int n,int *s1,int *s2)/*选择权值最小和次小的两个结点*/
{ int i;
int min;
for(i=1;i<=n;i++)
{
if(ht[i].parent==0)
{ min=i;
break;
}
}
for(i=1;i<=n;i++)
{
if(ht[i].parent==0)
{
if(ht[i].weight min=i;
}
}
*s1=min;
for(i=1;i<=n;i++)
{
if(ht[i].parent==0&&i!=(*s1))
{
min=i;
break;
}
}
for(i=1;i<=n;i++)
{
if(ht[i].parent==0&&i!=(*s1))
{
if(ht[i].weight min=i;
}
}
*s2=min;
}

void CrtHuffmanTree(HTNode ht[],HF hf[],int n)
{
int m,i;
int s1,s2;
m=2*n-1;
for(i=1;i<=n;i++)/*叶子结点初始化*/
{
ht[i].weight=hf[i].weight;
ht[i].parent=0;
ht[i].LChild=0;
ht[i].RChild=0;
}
for(i=n+1;i<=m;i++)/*非叶子结点初始化*/
{
ht[i].weight=0;
ht[i].parent=0;
ht[i].LChild=0;
ht[i].RChild=0;
}
for(i=n+1;i<=m;i++)
{ select(ht,i-1,&s1,&s2);
ht[i].weight=ht[s1].weight+ht[s2].weight;/*合并最小和次小结点*/
ht[s1].parent=i;
ht[s2].parent=i;
ht[i].LChild=s1;
ht[i].RChild=s2;
}
}

void GetHuffmanCode(HTNode ht[],int n)/*单个字符编码，使用栈*/
{
int j;
int i,c,p;
for(i=1;i<=n;i++)
{
top=-1;
j=0;
c=i;
p=ht[i].parent;
while(p!=0) /*编码值入栈*/
{
if(ht[p].LChild==c) /*判断结点是左孩子还是右孩子*/
hc[++top]='0';
else
hc[++top]='1';
c=p;
p=ht[p].parent;
}
printf("字符%c的编码值为-->",hf[i].ch);
while (top>-1)
{
printf("%c",hc[top]); /*编码值出栈，存入*/
hf[i].hc[j++]=hc[top--];
}
hf[i].hc[j]='\0';
printf("\n");
}
}

EnHfTreeCode(char A[],int x,char hc[],int n)/*整块语句编码，把译出的码值存放在fp指向的文件中*/
{
int i,j;
FILE *fp;
char ch;
if((fp=fopen("c:\\enCode.txt","wt"))==NULL)
{
printf("打开文件有错!!");
getch();
exit(1);
}
for(i=0;i for(j=1;j<=n;j++)
{
if(A[i]==hf[j].ch)
fputs(hf[j].hc,fp);
}
fclose(fp);
printf("语句编码值为：\n");
fp=fopen("c:\\enCode.txt","r");
ch=fgetc(fp);
while(ch!=EOF)
{
putchar(ch);
ch=fgetc(fp);
}
fclose(fp);
printf("\n");
}

TranslateHufCode(char hc[],HTNode ht[],HF hf[],int n)/*译码*/
{ FILE *fp;/*文件fp中存放语句编码数值*/
FILE *fq;/*文件fq中存入译码语句*/
int i=1,j;
char ch;
if((fp=fopen("c:\\enCode.txt","rt"))==NULL)
{
printf("文件打不开，按任意键返回");
getch();
exit(1);
}
else
{
ch=fgetc(fp);
if((fq=fopen("c:\\deCode.txt","wt"))==NULL)
{
printf("读文件错误");
getch();
exit(1);
}
}

while(!feof(fp))/*未遇到文件尾*/
{
j=2*n-1;/*从根结点开始译码*/
while((ht[j].LChild!=0)&&ht[j].RChild!=0)/*左右孩子都存在*/
{
if(ch=='0')
j=ht[j].LChild;
else
j=ht[j].RChild;
ch=fgetc(fp);

}
printf("%c",hf[j].ch);
fputc(hf[j].ch,fq); /*译码的数值存入fq所指向的文件中*/
}
fclose(fq);
fclose(fp);
printf("\n");
}

main()
{
char A[10000];
int n;
int x,i,j,m;
int choice;
do
{
printf("按回车键进入主菜单！");
clearscreen();
printf(" :------------------------------------------------:\n");
printf(" ! 哈夫曼编译系统 !\n");
printf(" !================================================!\n");
printf(" ! 1. 哈夫曼树的建立 !\n");
printf(" ! 2. 哈夫曼编码 !\n");
printf(" ! 3. 哈夫曼译码 !\n");
printf(" ! 0. 结束程序 !\n");
printf(" :------------------------------------------------:\n");
printf("\n");
printf("请输入您选择的功能号<0-3>:");

scanf("%d",&choice);
getchar();
if(choice>0)
switch(choice)
{
case 1:x=ReadFile(A);
n=Account(A,x);
CrtHuffmanTree(ht,hf,n);
break;
case 2:GetHuffmanCode(ht,n);
EnHfTreeCode(A,x,hc,n);
break;
case 3:TranslateHufCode(hc,ht,hf,n);
break;
case 0:break;

}
}while(choice!=0);
}