数据结构课程设计-赫夫曼编码的应用

《数据结构课程设计-赫夫曼编码的应用》由会员上传分享，免费在线阅读，更多相关内容在工程资料-天天文库。

1、西南大学计算机与信息科学学院课程设计报告课程：数据结构课程设计题目：赫夫曼编码的应用级、专业：2014级计算机专业2班学生姓名：提交日期：2016年06月23日内容提要：这次的数据结构课程设计分为两个部分：基础部分和综合部分。基础的部分只是为了巩固基础知识，综合设计是主要部分。基础部分：基础部分是为了巩固加强基础知识，为综合的实验报告奠定基础。其中的内容包括一元多项式的相加，图的基本操作，树的基本操作。从基础部分着手，简单的两个多项式的相加的实现，图的基本操作的实现，树的基本操作的实现。综合部分：综合部分针对综合的设计能力的锻炼，在基础的部分上增强。综合部分

2、就是做赫夫曼编码译码系统。输入一些字符串或者是英文句子，根据字符出现的比重进行权值的计算，从而建立赫夫曼树，赫夫曼树是赫夫曼编码的基础，在赫夫曼树建立之上对其进行编码和译码。首先实现的是编码，其次是译码。根据每个字符的编码，译码的时候，输入密文，会自动的去编码表中寻找匹配的字符，从而进行译码，并打印出译码的明文。关键词：赫夫曼树编码电文译码链表图数据结构指针参考书目：《数据结构（C语言版）》清华大学出版社严蔚敏吴伟民编著《数据结构课程设计第2版》机械工业出版社苏仕华魏韦巍王敬生刘燕君编著成绩评定：指导教师（签字）：年月日目录一、基础设计部分·········

3、···················································011.问题描述······························································012.功能需求分析························································013.总体设计······························································014.详细设计·················

4、·············································025.源代码·································································036.测试····································································177.总结····································································18二、综合设计部分·······

5、·····················································201.问题描述······························································202.功能需求分析························································203.总体设计······························································214.详细设计···············

6、···············································225.源代码·································································256.测试····································································307.总结····································································31三、参考文献·······

7、···························································3131一、基础部分课程设计1问题描述基础部分有三个基础的简单的程序。在这三个简单的课程设计之中要实现一元多项式的相加、图的基本操作以及树的基本操作。针对一元多项式相加的问题，如何实现在屏幕上把输入的两个要相加的一元多项式分别的显示出来以及相加以后的结果以多项式的形式显示出来？针对图的基本操作，如何实现用领接矩阵建立一个图？如何在建立好一个图的基础上实现广度优先和深度优先遍历等等问题？针对树的综合，如何运用二叉链表建立树？以及二叉链表的遍历（

8、包括先序、中序、后序、递归、非递归等）的实现等问题的