登录
首页 » Visual C++ » 04huffman_a

04huffman_a

于 2007-05-29 发布 文件大小:1KB
0 192
下载积分: 1 下载次数: 1

代码说明:

  根据最常用的链表法进行huffman编码,可以手工预制权重,例如n=8的时候即可以在文件中写入,输出相应的编码结果(According to the most commonly used method of Chain Huffman coding, manual can be prefabricated weight, For example, n = 8 when it is written in the document, the output corresponding to the coding results)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • hanoi
    实现汉诺塔的操作步骤输出,可以设置1,2,3三个塔柱,输出结果为用1,2,3表示的操作(Tower of Hanoi the steps to achieve the output, you can set 1,2,3 3 Pylon, the output result of the operation that used 1,2,3)
    2009-12-05 22:11:52下载
    积分:1
  • toycon
    二查树遍历文件,可以用于程序测试,有喜欢的朋友要多多使用哦(Two check tree traversal file that can be used for program testing)
    2012-07-17 15:18:23下载
    积分:1
  • C++
    说明:  标准答案习题1 1.1 简述C++语言程序的结构特点。 答: (1)C++程序由一个或多个函数组成,其中至少有一个主函数main(),程序从主函数开始执行,由主函数来调用其他函数。(Standard answer to Exercise 11.1 on C++ Language program structural characteristics. Answer: (1) C++ Procedures by one or more functions, of which at least one of the main function main (), the procedure started from the main function, from the main function to call the other function.)
    2008-11-25 16:16:27下载
    积分:1
  • erchashu
    二叉树的链式存储、先序中序遍历和层次遍历。(构造一棵树并输入数据,编写三个函数,非别是树的前序递归遍历算法、树的后序递归遍历算法、树的非递归中序遍历算法(这里的非递归以中序为例)。在主程序中调用这三个函数进行树的遍历,观察用不同的遍历方法输出的数据的顺序和验证递归与非递归输出的数据是否一样。)(Chain store binary tree, preorder traversal and hierarchy traversal.)
    2013-12-07 23:16:06下载
    积分:1
  • ABC-VC
    蜂群算法C语言实现,附带中文注释,简单易懂(ABC algorithm coded using C programming language)
    2020-09-16 02:17:56下载
    积分:1
  • DP
    说明:  动态规划是用空间换时间的一种方法的抽象。(Dynamic programming is to use space in time a method of abstract.)
    2012-11-12 08:52:31下载
    积分:1
  • ALGraph
    学数据结构自己总结的东西,希望对大家有所帮助。(Learn data structure sum things up, we want to help.)
    2013-03-08 19:50:18下载
    积分:1
  • SelectSort
    选择排序的实现,是一种基本的排序方法,但是时间复杂度相对较大。(Select Sort realization, is sort of a basic, but relatively large time complexity.)
    2012-09-27 22:38:22下载
    积分:1
  • astar
    A*算法 1、将开始节点放入开放列表(开始节点的F和G值都视为0) 2、重复以下步骤: 在开放列表中查找具有最小F值的节点,并把查找到的节点作为当前节点 把当前节点从开放列表删除, 加入到封闭列表. (A* algorithm 1, will begin to node placed in the and opening up list of (the began to node of the F and G values ​ ​ are regarded as 0) 2, repeat the the following steps: to Find a the has a the the smallest F value of the node in the the and opening up list of, and put Find a to the node as the current node current node is removed from the open list, added to the closed list.)
    2013-04-04 11:06:42下载
    积分:1
  • binary
    实现对二叉树的操作:建树、遍历、求层高、叶子数和结点数等(binary tree)
    2011-12-09 15:58:29下载
    积分:1
  • 696518资源总数
  • 105554会员总数
  • 2今日下载