C语言实现哈夫曼编码与译码.doc

信息工程1102 苑博 2011116020230C语言实现哈夫曼编码与译码#include;#define n 6 ;#define m (2*n-1) ;#define maxval 10000.0;#define maxsize 100 ;typedef struct; char ch; float weight; int lchild,rchild,parent;hufmtree;typedef struct; char bitsn; int start; char ch; codetype;void huffman(hufmtree tree);void huffmancode(codetype code,hufmtree tree);void decode(hufmtree tree);void main() printf( 哈夫曼编码n); printf(总共有%d个字符n,n); hufmtree treem; codetype coden; int i,j; huffman(tree); huffmancode(code,tree); printf(【输出每个字符的哈夫曼编码】n); for(i=0;in;i+) printf(%c: ,codei.ch); for(j=codei.start;jn;j+) printf(%c ,codei.bitsj); printf(n); printf(【读入电文，并进行译码】n); decode(tree);void huffman(hufmtree tree) int i,j,p1,p2; float small1,small2,f; char c; for(i=0;im;i+) treei.parent=0; treei.lchild=-1; treei.rchild=-1; treei.weight=0.0; printf(【依次读入前%d个结点的字符及权值(中间用空格隔开)】n,n); for(i=0;in;i+) printf(输入第%d个字符为和权值,i+1); scanf(%c %f,&c,&f); getchar(); treei.ch=c; treei.weight=f; for(i=n;im;i+) p1=0;p2=0; small1=maxval;small2=maxval; / for(j=0;ji;j+) if(treej.parent=0) if(treej.weightsmall1) small2=small1; small1=treej.weight; p2=p1; p1=j; else if(treej.weightsmall2) small2=treej.weight; / p2=j; treep1.parent=i; treep2.parent=i; treei.lchild=p1; treei.rchild=p2; treei.weight=treep1.weight+treep2.weight; /huffmanvoid huffmancode(codetype code,hufmtree tree) int i,c,p; codetype cd; for(i=0;in;i+) cd.start=n; cd.ch=treei.ch; c=i; p=treei.parent; while(p!=0) cd.start-; if(treep.lchild=c) cd.bitscd.start=0; elsecd.bitscd.start=1; c=p; p=treep.parent; codei=cd; /huffmancodevoid decode(hufmtree tree) int i,j=0; char bmaxsize; char endflag=2; i=m-1; printf(输入发送的编码(以2为结束标志)：); gets(b); printf(译码后的字符为); while(bj!=2) if(bj=0) i=treei.lchild; else i=treei.rchild; if(treei.lchild=-1) pr