网站首页

登录

Huffman-Tree

于 2015-05-22 发布文件大小:2803KB

 0  265

下载积分: 1 下载次数: 10

我要下载

代码说明：

使用三叉链表实现的哈夫曼树,统计inputfile1.txt中各字符的出现频率，并据此构造Huffman树，编制Huffman 码；根据已经得到的编码，对01形式的编码段进行译码。具体的要求： 1．将给定字符文件编码，生成编码，输出每个字符出现的次数和编码； 2．将给定编码文件译码，生成字符，输出编码及其对应字符。 (Emergence of the frequency of each character in the trigeminal lists using the Huffman tree, statistics inputfile1.txt, and accordingly the Huffman tree structure, preparation of Huffman code according to the coding has been. 01 to form the code segment for decoding. Specific requirements: 1 coding the given character file, generating the encoding, and outputting the number and encoding of each character 2 will be given the encoding file decoding, generating the character, the output code and its corresponding character.)

下载说明：请别用迅雷下载，失败请重下，重下不扣分！

发表评论

0 个回复

FIFO-c
说明：操作系统先来先服务调度算法模拟（C描述）(Operating a first-come first-served scheduling simulation (C description))

2010-04-13 00:02:35下载

积分：1
ahuangCD
这个是数据结构课程设计中阿黄的CD的程序代码的工程文件包(This is a data structure curriculum design A yellow CD program code works package)

2013-12-21 18:53:00下载

积分：1
StackandQueue
该ppt包含了栈和队列的数据结构及基本操作，同时还有栈的举例(This ppt contains the stack and queue data structure and basic operation, as well as examples of the stack)

2013-12-06 21:02:24下载

积分：1
mataqipan
马踏棋盘的贪心算法，8*8棋盘，基本上不用回溯。(horse riding chessboard of the greedy algorithm, 8* 8 chessboard, basically not retroactive.)

2006-05-30 20:05:17下载

积分：1
Insert-and-delete-binary-sort-tree
用c/c++写的二叉排序树的插入与删除，有兴趣的朋友可以看一下(Insertions and deletions using c/c++ to write binary sort tree)

2015-01-22 14:24:13下载

积分：1
delete
数据结构实验练习删除相同的节点希望会对大家有所帮助(Data structures lab exercises to remove the same node want to be helpful to everyone)

2012-11-14 12:59:15下载

积分：1
mowang-language
魔王语言：输入一串字符，可自动翻译成一串语言。(the program of language)

2014-07-12 21:57:27下载

积分：1
BiTree
二叉树的设计。包含二叉树结点类的设计以及二叉树的遍历。(Binary tree design. Contains the binary tree node class design, and Binary Tree Traversal.)

2008-01-11 10:19:38下载

积分：1
zuiyouerfenjiansuozhu
最优二叉搜索树问题具有最优子结构性质，即其任意一棵子树都是一棵独立的最优二叉搜索树，所以可以采用动态规划方法，并且在每次更新时保存子树的根。(Optimal binary search tree problem has optimal substructure property that any of its sub-tree are an independent optimal binary search tree, so you can use dynamic programming methods, and save each update subtree roots.)

2013-10-10 18:48:17下载

积分：1
Josephus(data_struct)
数据结构中基于约瑟夫环问题，用C++方式实现的。。。。。(Data structure based on Josephus problem with C++ a manner. . . . .)

2013-11-17 11:30:24下载

积分：1

696516资源总数
106914会员总数
0今日下载