哈夫曼编译器

参考文献[1]严蔚敏,吴伟民.数据结构(C语言版)[M].北京:清华大学出版社,2006[2]吕国英.算法设计与分析[M].北京:清华大学出版社,2006[3]徐宝文,李志.C程序设计语言[M].北京:机械工业出版社,2004[4]ErichGamma,RichaedHelm.设计模式(英文版)[M].北京:机械工业出版社,2004沈阳航空航天大学课程设计报告附录（程序清单）#include<stdio.h>#include<stdlib.h>#include<string.h>#include<graphics.h>//图形文件#defineR15typedefstruct_NODE{ charword; intvalue; _NODE*left,*right;}Node,*LPNode; typedefstructpoint{intx,y;//树节点坐标}point;typedefstruct_CONTAINER{ LPNodev; struct_CONTAINER*last,*next;}Container,*LPContainer;typedefstruct_CODENODE{ charword; charcode[100]; struct_CODENODE*next;}CodeNode,*LPCodeNode;voidinsert(LPContainerlist,LPContainernode){ LPContainerp; p=list->last; while(node->v->value<p->v->value) { p=p->last; } node->last=p; node->next=p->next; p->next->last=node; p->next=node;}LPNodecreateHuffmanTree(LPContainerlist){ LPContainerp; LPNodeleft,right,t; while(list->next!=list->last) { p=list->next; list->next=p->next; left=p->v; free(p); p=list->next; list->next=p->next; list->next->last=list; right=p->v; t=(LPNode)malloc(sizeof(Node)); t->word=-1; t->value=left->value+right->value; t->left=left; t->right=right; p->v=t; insert(list,p); } p=list->next; list->next=p->next; list->next->last=list; left=p->v; free(p); returnleft;}LPNodeGetInput(){ Containerlist; LPContainerp; LPNodehead; inti,num; printf("输入字符集规模："); scanf("%d",&num); list.v=(LPNode)malloc(sizeof(Node)); list.v->word=-1; list.v->value=0; list.v->left=list.v->right=NULL; list.next=&list; list.last=&list; for(i=0;i<num;i++) { p=(LPContainer)malloc(sizeof(Container)); p->v=(LPNode)malloc(sizeof(Node)); p->v->left=p->v->right=NULL; getchar(); printf("输入字符："); scanf("%c",&p->v->word); printf("输入该字符的权值："); scanf("%d",&p->v->value); insert(&list,p); } printf("正在构造哈夫曼树……\n"); head=createHuffmanTree(&list); printf("哈夫曼树创建成功!\n"); free(list.v); returnhead;}voiddfs(LPNodet,char*code,LPCodeNodelist){ LPCodeNodep; charl[100],r[100]; if(t->word!=-1) { p=(LPCodeNode)malloc(sizeof(CodeNode)); p->word=t->word; strcpy(p->code,code); p->next=list->next; list->next=p; return; } strcpy(l,code); strcat(l,"0"); dfs(t->left,l,list); strcpy(r,code); strcat(r,"1"); dfs(t->right,r,list);}LPCodeNodecreateCodeList(LPNodetree){ CodeNodehead; head.next=NULL; dfs(tree,"",&head); returnhead.next;}voidcode(LPCodeNodelist){ FILE*sfp,*dfp; charpath[256],c; LPCodeNodep; printf("请输入源文件路径："); scanf("%s",path); sfp=fopen(path,"rt"); printf("请输入目标文件路径："); scanf("%s",path); dfp=fopen(path,"wt"); while((c=fgetc(sfp))!=EOF) { p=list; while(p->word!=c) p=p->next; fputs(p->code,dfp); } fclose(sfp); fclose(dfp);}voiduncode(LPNodetree){ FILE*sfp,*dfp; charpath[256],c; LPNodep; printf("请输入源文件路径："); scanf("%s",path); sfp=fopen(path,"rt"); printf("请输入目标文件路径："); scanf("%s",path); dfp=fopen(path,"wt"); p=tree; while((c=fgetc(sfp))!=EOF) { if(c=='0') p=p->left; else p=p->right; if(p->word!=-1) { fputc(p->word,dfp); p=tree; } } fclose(sfp); fclose(dfp);}voidprint(LPCodeNodelist){ printf("\n字符-哈夫曼编码对照表\n"); while(list!=NULL) { printf("%c--%s\n",list->word,list->code); list=list->next; } printf("\n");}voidwindow()//初始化图形眶{initgraph(480,320,SHOWCONSOLE); setcolor(YELLOW); pointdian[6]; dian[0].x=192;dian[0].y=96; dian[1].x=128;dian[1].y=144; dian[2].x=256; dian[2].y=144; dian[3].x=220; dian[3].y=192; dian[4].x=320; dian[4].y=192; for(inti=0;i<5;i++) {circle(dian[i].x,dian[i].y,R); floodfill(dian[i].x,dian[i].y,YELLOW);//填充颜色Sleep(1000); } line(dian[2].x,dian[2].y,dian[3].x,dian[3].y); line(dian[2].x,dian[2].y,dian[4].x,dian[4].y); Sleep(1000); line(dian[0].x,dian[0].y,dian[1].x,dian[1].y);line(dian[0].x,dian[0].y,dian[2].x,dian[2].y);}voidmain(){ LPNodetree=NULL; LPCodeNodelist=NULL; intt; while(1) { printf("*******************************************"); printf("\n*哈夫曼编/译器*\n"); printf("\n*1.输入字符集*\n*2.编码*\n*3.解码*\n*4.演示*\n*5.退出*\n"); printf("**"); printf("\n*******************************************\n"); printf("\n请输入操作码："); scanf("%d",&t); switch(t) { case1: tree=GetInput(); list=createCodeList(tree); print(list); break; case2: code(list); break; case3: uncode(tree); break; case4: window(); break; case5: exit(0); } }}课程设计总结：通过此次课程设计，是我在数据结构的设计和算法设计等方面有了进一步的提高。关