Huffman编码器.doc

#include#includestring.husing namespace std;#define MAX 100#define N 26typedef struct/哈夫曼树的结点 unsigned int weight; unsigned int parent,lchild,rchild;HTNode,*Huffmantree; typedef struct /字符存储结点信息 char data; /待编码的字符 int weight; /字符的权值 char codeN; /字符的编码 HTCode;/初始化结点信息void InitCode(HTCode *Hr,int &n) coutn; cout请输入待编码字符以及相应的权值：endl; for(int i = 1;i (Hr+i)-data(Hr+i)-weight; void Select(Huffmantree &HT,int end,int *s1,int *s2)/在0end之间,找出最小和次小的两个结点序号,返回S1,S2 int i; int min1 = MAX; int min2; for (i = 1;i parent = 0 & (HT+i)-weightweight; min2 = MAX; for(i = 1;i parent = 0 & *s1 != i & min2 = (HT+i)-weight) *s2 = i; min2 = (HT+i)-weight; /初始化哈夫曼树,并把信息存入Hrvoid InitHfmtree(Huffmantree &Ht,HTCode Hr,int &n) if(n = 1) return; int m,start,i,j,f; int s1,s2; m = 2*n-1; /n个顶点有m个节点 Ht = (Huffmantree)malloc(m+1)*sizeof(HTNode); Huffmantree P; P = Ht+1; for(i = 1;i = m;i+,P+) /0号单元没用 if(i weight = Hri.weight; else P-weight = 0; P-lchild = 0; P-rchild = 0; P-parent = 0; for(i = n+1;i parent = i; (Ht+s2)-parent = i; (Ht+i)-lchild = s1; (Ht+i)-rchild = s2; (Ht+i)-weight = (Ht+s1)-weight + (Ht+s2)-weight; char *code; code = (char *)malloc( n*sizeof(char); coden-1 = 0; for(i = 1;i code start = n-1; for(j = i,f = Htj.parent;f != 0;j = f,f = Htf.parent) if(Htf.lchild = j) code-start = 0; else code-start = 1; strcpy(Hri.code,&codestart); cout字符编码初始化完成！endl; void Encoding(HTCode *Hr,int n)/编码 int i,j; char *encode; encode = (char *)malloc( n*sizeof(char); cout请选择你想要编码的字符：encode; for(i = 0;encodei!=0;i+) j = 1; while(encodei != Hrj.data) j+; if(jn) cout您输入编码encodei错误！endl; else coutHrj.data的编码是Hrj.codeendl; /cout编码已经结束！endl; /coutHrj.data的编码是Hrj.codeendl; cout编码已经结束！endl;void Decoding(HTCode *Hr,int n)/译码 int j=1; char *decode; decode = (char *)malloc( n*sizeof(char); cout请输入你想要译码的字符串：decode; for(j=1;jn) cout您输入译码的字符串错误！endl; else coutHrj.code的译码是Hrj.dataendl; cout译码已经结束！endl; void TreePrint(Huffmantree &HT,HTCode Hr,int n)/打印各个结点信息 int i,j; coutnn*打印哈夫曼树*nendl; cout 结点 weight parent lchild rchildendl; for (j=1; j=n; j+) printf(n%4d(%c)%5d%8d%8d%8dn,j,Hrj.data,HTj.weight,HTj.parent,HTj.lchild,HTj.rchild); for (i=n+1; i = 2*n-1; i+) printf(n%4d%8d%8d%8d%8dn,i,HTi.weight,HTi.parent,HTj.lchild,HTi.rchild); void main() Huffmantree Ht; HTCode HrN; coutt*欢迎使用赫夫曼编译码*endl; int n = 0; char cmd; do cout*初始化赫夫曼树（I） 编码（E） 译码（D） 印赫夫曼树（T） 离开（Q）*cmd; switch(cmd) case I: InitCode(Hr,n); InitHfmtree(Ht,Hr,n); break; case E: Encoding(Hr,n); break; case D: Decoding(Hr,n); break; case T: TreePrint(Ht,Hr,n);adaptation n. 适应（性）；改编本 break;adj. 灰色的；有灰斑的Korea n. 韩国；朝鲜 case Q:（pl stadiums or stadia） coutt*欢迎您的使用！*endl; e