C++代码 赫夫曼编译.docVIP

/* 置以下数据于f:\\临时\\aa.txt 8 5 29 7 8 14 23 3 11 ABCDEFGH AHDC */ //------------------------赫夫曼编码----------------------------- #includeiostream #includefstream #includestring #includeiomanip #includestdlib.h using namespace std; //--------------------------------------------------------------- typedef struct{ unsigned int weight; unsigned int parent,lchild,rchild; }HTNode,*HuffmanTree; //动态分配数组存储赫夫曼树 typedef char **HuffmanCode; //动态分配数组存储赫夫曼编码表 class Huffman{ private: HuffmanTree HT; //储赫夫曼树 HuffmanCode HC; //赫夫曼编码表 int *w; //频度 string str; //字符串 int n; //n个字符 public: void Initialization(ifstream in); //初始化 void HuffmanCoding(); //赫夫曼编码 void Select(int h,int s1,int s2,int l); //查找两个最小值 void Encoding(ifstream in,ofstream out);//编码 void Decoding(); //译码 void PrintH(); //输出编码 }; //--------------------------------------------------------------- int main(){ ifstream in(f:\\临时\\aa.txt); ofstream out(f:\\临时\\bb.txt); Huffman huffman; huffman.Initialization(in); huffman.HuffmanCoding(); huffman.PrintH(); huffman.Encoding(in,out); huffman.Decoding(); return 0; } //--------------------------------------------------------------- void Huffman::HuffmanCoding(){ //w存放n个字符的权值(均0)，构造赫夫曼树HT，并求出n个字符的赫夫曼编码HC。 if(n = 1) return; int m = 2 * n - 1,i,l = 1,c,f,start; HuffmanTree p; //0号单元未用 HT = (HuffmanTree)malloc((m+1)*sizeof(HTNode)); //*/HT = new HTNode[m+1]; for(p = HT + 1,i = 1;i = n;i++,p++,w++){ p-weight = *w; p-lchild = 0; p-rchild = 0; p-parent = 0; } for(;i = m;i++,p++){ p-weight = 0; p-lchild = 0; p-rchild = 0; p-parent = 0; } for(i = n + 1;i = m;i++,l++){//建赫夫曼树 //在HT[1..i-1]选择parent为0且weight最小的两个结点，其序号分别为s1和s2。 int s1,s2; Select(i - 1,s1,s2,l); //couts1 s2endl; HT[s1].parent = i; HT[s2].parent = i; HT[i].lchild = s1; HT[i].rchil