登录
首页 » Visual C++ » Huffman-Tree

Huffman-Tree

于 2015-05-22 发布 文件大小:2803KB
0 252
下载积分: 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 个回复

  • bstree_frame
    利用二叉平衡树进行数据排序。这里采用的数据结构是指针。(The use of balanced binary tree sort the data. The data structure used here is a pointer.)
    2013-08-10 16:43:50下载
    积分:1
  • Euler-algorithm
    这是一个实现找出欧拉路径的的算法,比较完美的解决了欧拉算法(This is an implementation of the algorithm to find Euler path, the more perfect solution to the Euler algorithm)
    2014-07-13 15:20:12下载
    积分:1
  • Graph
    采用邻接矩阵实现有向网的存储,建立有向网,并实现单源最短路径算法。(The realization of the use of adjacency matrix to the network storage, the establishment of the network, and to achieve single-source shortest path algorithm.)
    2007-12-25 16:55:03下载
    积分:1
  • Classic-single-linked-list
    单链表是C经典数据结构算法和数据结构,希望这对大家学习有点用(Classic single-linked list data structure in C algorithms and data structures, which we hope to learn a little bit with)
    2011-08-02 12:33:26下载
    积分:1
  • 1
    说明:  可以实现判断二叉树是否为完全二叉树、判断两棵二叉树是否镜像对称、求一棵二叉树的一个最长枝等功能(Can determine whether the binary tree is complete binary tree to determine whether two binary mirror symmetry, one of the longest seeking a binary tree branches and other functions)
    2013-11-13 21:16:53下载
    积分:1
  • Hash-table
    哈希表 数据结构课程设计 1.1问题描述 针对自己的班集体中的“人名”设计一个哈希表,使得平均查找长度不超过R,完成相应的建表和查表程序。 1.2基本要求 假设人名为中国姓名的汉语拼音形式。待填入哈希表的人名共有30个,取平均查找长度的上限为2。构造哈希函数,用链表法处理冲突。 1.3测试数据 读取熟悉的30个人的姓名作测试。(Hash table Data Structure Course Design 1.1 Description of the problem For their own class group of the "names" to design a hash table, making the average search length does not exceed R, the completion of construction of tables and look-up table corresponding procedures. 1.2 Basic requirements Assuming the name of the person called Chinese pinyin form. To be filled into a hash table names a total of 30, taking the average search length of the upper limit of 2. Construct a hash function, treatment with a list of conflict. 1.3 Test Data Read the familiar names of 30 individuals tested.)
    2011-12-19 15:39:00下载
    积分:1
  • a
    说明:  进程死锁.资源分配图的绘制 建立所需数据结构;  使用题目21存成的资源分配图的文件作为输入;  编写资源分配图化简算法;  每化简一步,在屏幕上显示化简的当前结果;  最后给出结论,是否死锁,如思索给出死锁的进程及资源; (Process deadlock. Resource allocation mapping  establish the required data structures  Use title 21 deposit into resource allocation graph file as input  writing resource allocation map simplification algorithm  Each simplification step, on-screen display simplification of the current result  Finally, the conclusion of a deadlock, deadlock is given as thinking processes and resources )
    2013-07-04 19:50:58下载
    积分:1
  • fast_sort
    /*快速排序:以待排序元素中的第一个元素作为基准将带排序的元素分为三组 *大于基准元素为一组置于基准值的右边,小于基准值的元素为一组置于基准值的左边, *基准值为一组,这样就找到了基准元素的位置就确定了 *如此递归调用。直到每一组的low==high,即实现了排序的要求。 */ (/* Rapid Sort: the first element to be sorted in the element as a basis with with sorting the elements are divided into three groups* is greater than the reference element of a group is placed on the right side of the reference value, smaller than the reference value elements for a group of placed on the left side of the reference value,* reference value, a group, so that the location of the reference element is found it is determined* so recursive call. Until each group of low == high to achieve the requirements of the sort.* /)
    2012-10-26 21:42:43下载
    积分:1
  • kruscal_Primspanningtree
    最小生成树两种经典算法,kruscal和Prim算法(spanning tree)
    2010-07-14 10:10:54下载
    积分:1
  • maze
    说明:  由数字1和0组成迷宫,0代表可走路径,程序会用坐标的形式给出每一步的走法(Composed by a maze of numbers 1 and 0, 0 to go the path, the program will use the coordinates given in the form of moves at each step)
    2011-03-27 20:57:47下载
    积分:1
  • 696516资源总数
  • 106637会员总数
  • 8今日下载