huffman压缩红楼梦源程序.docVIP

Huffman压缩红楼梦源程序 -----计科4班,张青 /*huffman算法压缩红楼梦*/ #includeiostream #includefstream #includestdlib.h #includemath.h #includestring.h #includectime//时间统计头文件 using namespace std; struct Huffman_node{//定义huffman数据结构类型 char a; char string[20]; int freq_; int lc_; int rc_; }; //函数申明 void search(Huffman_node huff[],int N,int top[]); void code(Huffman_node huff[],int root,int p,char string[],int i,int); void zip(Huffman_node huff[],int N); char trans(char string[]); void release(Huffman_node huff[],int N); void transback(char ch,char*); int check(Huffman_node huff[],char str[],int N); FILE *infile,*outfile; int main() { Huffman_node huff[514]; ifstream myfile(红楼梦.txt); int i,N=0,j; char ch1; if(myfile==NULL) cout无法打开文本文件；; else while(myfilech1){//遍历红楼梦文本，统计出现的不同字符 for(j=0;jN;j++) if(huff[j].a==ch1) break; if(j==N){ huff[j].a=ch1; huff[j].freq_=1; N++; } else huff[j].freq_++; } int top[2]; for(i=N;i2*N-1;i++){//用huffman数组构建haffman树 search(huff,i,top); huff[i].lc_=top[0]; huff[i].rc_=top[1]; huff[i].freq_=huff[top[0]].freq_+huff[top[1]].freq_; huff[top[0]].freq_=0;huff[top[1]].freq_=0; } char string[20]; code(huff,2*N-2,0,string,0,N); clock_t previoust=clock(); zip(huff,N); clock_t currentt=clock()-previoust; cout压缩用时：currenttendl; previoust=clock(); release(huff,N); currentt=clock()-previoust; cout解压用时：currenttendl; system(pause);return 0; } void search(Huffman_node huff[],int n,int top[])//找出huffman数组中最小的两个频率函数 { int i,min;