数据结构课程设计哈夫曼.docVIP

#includeiomanip.h #includeiostream.h #includestring.h #define MAX 99 char cha[MAX]; char hc[MAX-1][MAX]; int s1,s2; //设置全局变量，以便在方法(函数)select中返回两个变量 typedef struct //huffman树存储结构 { unsigned int weight;//权值 int lchild,rchild,parent; }huftree; void select(huftree tree[],int k) //找寻parent为0,权最小的两个节点 { int i; for (i=1;i=k tree[i].parent!=0 ;i++); s1=i;//初始化s1 for (i=1;i=k;i++) if (tree[i].parent==0 tree[i].weighttree[s1].weight) s1=i;//把最小值赋给s1 for (i=1; i=k ; i++) if (tree[i].parent==0 i!=s1) break; s2=i;//初始化s2 for (i=1;i=k;i++) if ( tree[i].parent==0 i!=s1 tree[i].weighttree[s2].weight) s2=i;//把最小值赋给s2 } void huffman(huftree tree[],int *w,int n) //生成huffman树 { int m,i; if (n=1) return; m=2*n-1; for (i=1;i=n;i++)//给tree中每个结点权值赋值，且分别给左右孩子及双亲初始化 { tree[i].weight=w[i]; tree[i].parent=0; tree[i].lchild=0; tree[i].rchild=0; } for (i=n+1;i=m;i++)//给除了叶子结点下的其它结点初始化 { tree[i].weight=0; tree[i].parent=0; tree[i].lchild=0; tree[i].rchild=0; } for (i=n+1;i=m;i++)//最终结果 { select(tree, i-1); tree[s1].parent=i; tree[s2].parent=i; tree[i].lchild=s1; tree[i].rchild=s2; tree[i].weight =tree[s1]. weight+ tree[s2].weight; } } void huffmancode(huftree tree[],char code[],int n)//输出huffman编码 { int start,c,i,f; cout哈夫曼树：endl;//输出hufftree for(i=1;i=2*n-1;i++) coutsetw(0)i setw(5)tree[i].weight setw(5)tree[i].parent setw(5)tree[i].lchild setw(5)tree[i].rchild endl; code[n-1]=\0;// cout哈夫曼编码:endl; for(i=1;i=n;i++) {start=n-1; for(c=i,f=tree[i].parent;f!=0;c=f,f=tree[f].parent)//输出huffman编码 {if(tree[f].lchild==c) code[--start]=0;//把编码存入code else code[--start]=1;} strcpy(hc[i],code[start]);//把code分别复制给hc coutcha[i]--hc[i]endl;//分别输出编码 for是满足条件进入 } } void tohuffmancode(int n)//编码部分 { int i=0,j; char anychar[9999]; cout请输入你要编码的字符串:endl; cinanychar; cout编码为:; for (;anychar[i]!=\0;i++) { j=0; for(;anychar[i]!=cha[j]j=n;) j++; if (j=n) couthc[j]; } coutendl; } void decode(char ch[],huftree tree[],int n)//译码 { int i,j,m;char b; m=2*n-1; i=m; cout请输入编码:endl; cinb; cout译码为:; while(b!=\n) //遇到回车时，结束