实验名称哈夫曼码的实现；.docVIP

实验名称:哈夫曼编码的实现; 实验目的:利用贪心算法的思想实现哈夫曼编码算法程序; 实验原理:前缀码是任一字符的代码都不是其他字符代码的前缀。使平均码长达到最小的前 缀码编码方案称为最优前缀码。表示最优前缀码的二叉树是一棵完全二叉树，即树中任一结点都有两个儿子结点。哈夫曼算法以自底向上的方式构造表示最优前缀码的二叉树T。算法以|C|个叶结点开始，执行|C|-1次的“合并”运算后产生最终所要求的树T。 实验环境:VC++ 6.0 实验过程: 程序代码如下： ////******Huffman编码*******//////// #include iostream.h #include stdlib.h const int N=100; //////////////////////// class Bintree { public: Bintree(){} Bintree(char a) { data=a; code=0; sign=l; flag=N; leftch=NULL; rightch=NULL; } void MakeBintree(char a, Bintree *left, Bintree *right) { data=a; sign=l; flag=N; leftch=left; rightch=right; } void setdata(char a) { data=a; } char getdata() { return data; } void setcode(int c) { code=c; } int getcode() { return code; } void setsign(char a) { sign=a; } char getsign() { return sign; } void setflag(char a) { flag=a; } char getflag() { return flag; } class Bintree *leftch; class Bintree *rightch; private: char data; int code; char sign,flag; }; //////////// ///////////// class Huffman { public: void Huffman12(Bintree *tt, float w) { tree=tt; weight=w; next=NULL; } Bintree* gettree() { return tree; } float getweight() { return weight; } Huffman *next; private: Bintree *tree; float weight; }; ////////// /////////// class MinHeap { public: void Initialize(Huffman *h, int n); Huffman* RemoveMin(); void Put(Huffman *h); Huffman* gethm() { return hm; } private: Huffman *hm; }; /////////// void MinHeap::Initialize(Huffman *h, int n) { Huffman *first,*second,*temp; int i,j; temp=new Huffman; for(i=0; in-1; i++) { first=h; second=h-next; for(j=0;jn-i-1;j++) { if(second-next!=NULL second-getweight() second-next-getweight()) { temp=second-next; second-next=temp-next; temp-next=second; first-next=temp; first=first-next; } else { first=first-next; second=second-next; } } } hm=h; }; ///////// Huffman* MinHeap:: Remove