登录
首页 » Visual C++ » Huffman

Huffman

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

代码说明:

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

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

发表评论

0 个回复

  • cPP
    数据结构课设,城市地铁站的设计与使用规划(Set data structure class, subway station design and use of planning)
    2011-07-03 11:58:24下载
    积分:1
  • sad
    编程 主范式 使用真植表 用栈的应用 使用了 后缀表达式 (biancheng zhu fanshi)
    2012-06-18 14:16:30下载
    积分:1
  • Z
    说明:  在给定的字母中,用c++来实现字母的排序(In a given letter, the use of c++ to implement the letter of the sort)
    2010-06-29 21:59:50下载
    积分:1
  • Figure-topological-sort
    说明:  拓扑排序   对一个 有向无环图 G进行拓扑排序,是将G中所有顶点排成一个线性序列,使得图中任 意一对顶点u和v,若u,v ∈E,则u在线性序列中出现在v之前。   通常,这样的线性序列称为满足拓扑次序的序列,简称 拓扑序列 。 注意:   ①若将图中顶点按拓扑次序排成一行,则图中所有的有向边均是从左指向右的。   ②若图中存在有向环,则不可能使顶点满足拓扑次序。   ③一个DAG的拓扑序列通常表示某种方案切实可行。 (Topological sort In a directed acyclic graph G topological sort, is all vertices will G formed a linear sequence, make diagram post Meaning a pair of vertex u and v, if u, v ∈ E, then u in linear sequence in which they appear in v before. Usually, such linear sequence sequence of topological order called meet, abbreviation topology sequence. Note: (1) if the diagram according to the topology order line vertices, then figure all from left to right edge are pointing. (2) if the figure to exist in the ring, is impossible to have the vertex meet topological sequence. (3) a DAG topological sequence usually expressed some scheme is feasible. )
    2011-03-22 17:19:14下载
    积分:1
  • mapsearch
    数据结构,关键路径问题,设计并实现关键路径的一种应用,采用图的算法(Data structure, critical path problem, using graph algorithm)
    2016-01-09 17:34:45下载
    积分:1
  • InserSigList
    单链表的插入。数据结构中的算法小程序。初学者很适用。(Single-linked list insertion. Data structure of algorithm applet. Beginners are applicable.)
    2016-02-18 15:09:12下载
    积分:1
  • sort.cpp
    各种排序的模板实现,并分析了各种实现的时间复杂度及改进办法(Templates of various sort, and analyze the time complexity of the various implementations and ways to improve)
    2012-04-14 03:08:18下载
    积分:1
  • 9
    说明:  任意给定输入的一个小写英文字符串a1a2a3…an-1an (n≥5) 输出:字符串Ana1An-1a2An-2a3…A2an-1A1an,其中Ai为ai的大写形式 例如,输入aybdx,则递归程序输出XaDyBbYdAx (Any given input of a lowercase string a1a2a3 ... an-1an (n ≥ 5) Output: the string Ana1An-1a2An-2a3 A2an-1A1an, which Ai ai uppercase for example, input aybdx recursive program output XaDyBbYdAx)
    2012-05-30 10:59:39下载
    积分:1
  • lab07
    本例主要设计查找的有关算法,例如有序表的查找和顺序标的查找,顺序查找、折半查找及二叉排序树上查找的基本思想和算法实现等。(In this case mainly designed to find the relevant algorithm, such as an ordered list of the find and order the subject to find, sequential search, binary search and binary sort tree to find the basic idea and algorithm.)
    2013-05-12 22:01:58下载
    积分:1
  • Graph
    数据结构中图的遍历Data structure traversal of center(Data structure traversal of center)
    2013-11-28 10:53:29下载
    积分:1
  • 696518资源总数
  • 106259会员总数
  • 28今日下载