登录
首页 » Visual C++ » Huffman

Huffman

于 2014-01-28 发布 文件大小:1205KB
0 128
下载积分: 1 下载次数: 3

代码说明:

  数据结构,利用霍夫曼树实现文本数据的压缩。(Huffman data compression and decompression.)

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

发表评论

0 个回复

  • xianxingbiaolianjie
    线性表的链接实现可利用单链表来实现,每个节点存储一个元素。 利用单链表来实现线性表的元素的插入,删除,修改等功能。 (Linear link table can be used to achieve a single linked list to implement, each node stores an element. Using a single linked list to implement elements of the linear table insert, delete, modify, and other functions.)
    2011-04-26 11:57:25下载
    积分:1
  • mapsearch
    数据结构,关键路径问题,设计并实现关键路径的一种应用,采用图的算法(Data structure, critical path problem, using graph algorithm)
    2016-01-09 17:34:45下载
    积分:1
  • nuaa1507_DancingLink_trackback.cpp
    高德纳发明的高效数据结构dancing link,这里是解重复覆盖问题的一个演示(Donald Knuth invented efficient data structure dancing link, here is the solution to repeat coverage of a demonstration)
    2010-03-07 10:54:32下载
    积分:1
  • beipaowenti
    背包算法的c++简单实现,很有用的,可以看看(Knapsack algorithm)
    2012-04-10 19:32:41下载
    积分:1
  • KMP
    数据结构中KMP算法c语言实现,vc6.0环境(KMP algorithm in c language data structure, vc6.0 environment)
    2013-03-27 14:04:39下载
    积分:1
  • Dijkstra
    迪特斯特拉算法,课程设计的作品,主要计算站点距离的吧,可以看看(Dieter Stella algorithm, distance course design work, the main computing sites can look)
    2013-04-11 10:26:15下载
    积分:1
  • BiTree
    二叉树的设计。包含二叉树结点类的设计以及二叉树的遍历。(Binary tree design. Contains the binary tree node class design, and Binary Tree Traversal.)
    2008-01-11 10:19:38下载
    积分:1
  • ds-labs
    说明:  数据结构基本算法实现。包括栈、二叉树基本运算实现,同时包含整数计算器的完整实现。(The basic algorithm data structure. Including implementation of stack, binary tree basic operations, and a complete implementation of an integer calculator.)
    2011-03-27 03:01:02下载
    积分:1
  • quicksort
    数据结构快速排序例程代码,只要按照例子就可以很容易加入到你的程序当中。(Data Structures quick sort routine code, just follow the example you can easily add them into your program.)
    2013-05-23 15:05:53下载
    积分:1
  • maopao_youhua
    冒泡优化: 如果一个序列是int n[]={1,2,3,4,5,6,7,8,9} , 用正常的冒泡排序需要排8次才行,优化之后1次就好,也就是说序列越接近于正常序列,改进之后的冒泡排序的次数就越少,这样会给一个冒泡排序算法带了很大的效率。 思想:添加一个boolean变量用来判断冒泡是否是已经排好了顺序,如果boolean的值为false,说明是已经排好了,如果boolean的值true,说明没有排好,继续排。(If a sequence is int n [] = {, 1,2,3,4,5,6,7,8,9} need to row 8 times the job after optimization times like normal bubble sort, but alsomeans that the sequence is more close to the normal sequence, improved bubble sort, the less the number, which would give a bubble sort algorithm with a great deal of efficiency. Idea: add a boolean variable used to determine the bubble whether it is already lined up the order, if the boolean is false, indicating already lined up, if the boolean value of true, did not line up, continue to row.)
    2012-04-18 00:33:45下载
    积分:1
  • 696518资源总数
  • 105873会员总数
  • 12今日下载