登录
首页 » Visual C++ » Huffman

Huffman

于 2010-06-09 发布 文件大小:131KB
0 123
下载积分: 1 下载次数: 2

代码说明:

  哈夫曼树可以使读者快速方便的查找所需文件(Huffman tree allows readers to quickly and easily find the file)

文件列表:

我爱熙小月
..........\03081213-周晴.doc,259584,2010-05-24
..........\CodeFile.txt,123,2010-05-24
..........\CodePrin.txt,131,2010-05-24
..........\TextFile.txt,30,2010-05-24
..........\ToBeTran.txt,27,2010-05-24
..........\TreePrint.txt,498,2010-05-24
..........\哈夫曼.cpp,10601,2010-05-24

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

发表评论

0 个回复

  • Is_BST
    This is a C++ code. It finds out if the tree is a binary search tree (BST)or not, where the BST is one of data structures types.
    2012-02-02 05:45:59下载
    积分:1
  • pinfanfangwen
    设有一头指针为L的带有表头结点的非循环双向链表,其每个结点中除有prev(前驱指针),data(数据)和next(后继指针)域外,还有一个访问频度域freq。在链表被起用前,其值均初始化为零。每当在链表中进行一次Locate(L,x)运算时,令元素值为x的结点中freq域的值增1,并使此链表中结点保持按访问频度非增(递减)的顺序排列,同时最近访问的结点排在频度相同的结点的最后,以便使频繁访问的结点总是靠近表头。试编写符合上述要求的Locate(L,x)运算的算法,该运算为函数过程,返回找到结点的地址,类型为指针型。(Has a head pointer is non-circular doubly linked list L with a header node, each node in addition to prev (precursor pointer), data (data) and next (successor pointers) outside, there is an access frequency degree domain freq. Before the list was hired, their values are initialized to zero. Whenever carried out in the list once Locate (L, x) when the operation, so that the element node x is the value in freq domain by one, and keep this list in the node-access frequency of non-increasing (decreasing) the order, while a recent visit to the nodes in the same row of the frequency of the last node, so that the nodes are frequently accessed tables are always near the head. Locate (L, x) algorithm is prepared in accordance with the above requirements of the test operation, the operation as a function of the process, return to find the address of the node of type pointer.)
    2015-01-15 22:31:59下载
    积分:1
  • graph-DFS
    邻接表存储图,然后进行深度优先遍历及广度优先遍历。(DFS,adjacent matrix)
    2013-10-27 20:16:41下载
    积分:1
  • yeschengxu
    这是数据结构很重要的程序,主要是课后题的答案,和代码,功能很强大(the data struct of the book)
    2013-12-22 23:25:14下载
    积分:1
  • 1_1
    最小生成树算法 克鲁斯法尔算法 球最佳路径(kulru method class maiun void cx )
    2009-09-13 22:45:01下载
    积分:1
  • duilie
    队列的一般数据结构 队列的创建 删除 修改 取数据等等(The general data structure queue queue to take the data and so create delete modify)
    2010-09-08 14:36:38下载
    积分:1
  • mapsearch
    数据结构,关键路径问题,设计并实现关键路径的一种应用,采用图的算法(Data structure, critical path problem, using graph algorithm)
    2016-01-09 17:34:45下载
    积分:1
  • BresenhamLine
    在VC中实现Bresenham算法画直线(Bresenham algorithm in VC draw a straight line)
    2012-06-03 18:21:13下载
    积分:1
  • multiplication
    本程序是用c语言编写的在800位整数之间的乘积运算(This procedure is written in c the 800 integers in the product operation between)
    2009-05-16 22:04:42下载
    积分:1
  • youlishi
    有理数的算法,包括其加减乘除,启用的是单链表的形式来表达(Rational algorithms, including addition, subtraction, enabling a single-chain form of expression)
    2011-10-13 10:00:21下载
    积分:1
  • 696518资源总数
  • 105873会员总数
  • 12今日下载