- road 交通查询系统 实现飞机 火车 最短 最快 最经济 策略查询 我们数据库的课程设计 用笛杰斯特拉算法实现图中两节点最短路径 当时还没有学数据库 所以自己用TXT实现的数据库
- Pavlidis细化算法 功能:对图象进行细化 参数:image:代表图象的一维数组 lx:图象宽度 ly:图象高度
- 3dsrc 3d魔方源碼 使用語言 flex/flash/actionscript 3
- Avalon_VGA_Controller 可配置的vga显示控制器
- Java 用写的人事管理系统 数据库是sql 2
- OpenCV-Marker-less-AR-master Markerless AR using OpenCV
文件名称:hafumanshu
-
所属分类:
- 标签属性:
- 上传时间:2012-11-16
-
文件大小:3.61kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
(1) I:初始化,从终端读入n个字符和n个权值,建立哈夫曼树,并将它存放在文件HuffmanTree中.
(2)E:编码.利用已建立好的哈夫曼树,对要传输的数据正文(存在文件ToBeTran.txt中)进行编码,将结果代码存(传输)到文件CodeFile中.
(3)D:译码.利用已建好的哈夫曼树,对传输到达的CodeFile中的数据代码进行译码,将译码结果存入文件TestFile中.
(4) P: 印文件.将文件CodeFile以紧凑格式显示在终端上,每行50个代码。同时将此字符形式的编码文件写入文件CodePrin中。
(5) T:,印哈夫曼树,将内存中的哈夫曼树以直观的方式(可以树或凹入表的形式)显示在终端上,同时将此字符形式的编码文件写入文件TreePrin中。
-(1) I: initialization, read from the terminal n-n-weight character and to build the Huffman tree, and store it in the file HuffmanTree.
(2) E: coding. Using Huffman tree has been well-established, the body of data to be transferred (in the existing file ToBeTran.txt) encoding, the result code deposit (transfer) to a file in the CodeFile.
(3) D: decoding. Use of the Huffman tree has been completed, the transmission of data to reach the CodeFile code decoding, the decoding results stored in the file TestFile.
(4) P: printing documents. CodeFile file to the terminal on the compact format, each line of code 50. While this character is written in the form of the encoded file in the file CodePrin.
(5) T:, India Huffman tree, the Huffman tree in memory in an intuitive way (for the tree or recess in the form of tables) displayed in the terminal, but this character in the form of encoded file written to the file TreePrin in.
(2)E:编码.利用已建立好的哈夫曼树,对要传输的数据正文(存在文件ToBeTran.txt中)进行编码,将结果代码存(传输)到文件CodeFile中.
(3)D:译码.利用已建好的哈夫曼树,对传输到达的CodeFile中的数据代码进行译码,将译码结果存入文件TestFile中.
(4) P: 印文件.将文件CodeFile以紧凑格式显示在终端上,每行50个代码。同时将此字符形式的编码文件写入文件CodePrin中。
(5) T:,印哈夫曼树,将内存中的哈夫曼树以直观的方式(可以树或凹入表的形式)显示在终端上,同时将此字符形式的编码文件写入文件TreePrin中。
-(1) I: initialization, read from the terminal n-n-weight character and to build the Huffman tree, and store it in the file HuffmanTree.
(2) E: coding. Using Huffman tree has been well-established, the body of data to be transferred (in the existing file ToBeTran.txt) encoding, the result code deposit (transfer) to a file in the CodeFile.
(3) D: decoding. Use of the Huffman tree has been completed, the transmission of data to reach the CodeFile code decoding, the decoding results stored in the file TestFile.
(4) P: printing documents. CodeFile file to the terminal on the compact format, each line of code 50. While this character is written in the form of the encoded file in the file CodePrin.
(5) T:, India Huffman tree, the Huffman tree in memory in an intuitive way (for the tree or recess in the form of tables) displayed in the terminal, but this character in the form of encoded file written to the file TreePrin in.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
hafumanshu/haffuman.c
hafumanshu
hafumanshu
1999-2046 搜珍网 All Rights Reserved.
本站作为网络服务提供者,仅为网络服务对象提供信息存储空间,仅对用户上载内容的表现方式做保护处理,对上载内容本身不做任何修改或编辑。
