登录
首页 » Visual C++ » Huffman

Huffman

于 2011-03-29 发布 文件大小:1KB
0 254
下载积分: 1 下载次数: 0

代码说明:

说明:  数据结构:Huffman编码。哈夫曼编码是哈夫曼树的一个应用。哈夫曼编码应用广泛,如JPEG中就应用了哈夫曼编码。 哈夫曼树又称最优二叉树,是一种带权路径长度最短的二叉树。(Data structure: Huffman coding. Huffman coding is an application of the Huffman tree. Huffman coding is widely used, such as JPEG in the application of the Huffman coding. Huffman tree, also known as the best binary tree is a weighted shortest path length binary tree.)

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

发表评论

0 个回复

  • 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
  • order
    通过冒泡排序法和选择排序法实现对若干数字的排序。(To achieve the order of several numbers)
    2014-06-08 18:35:10下载
    积分:1
  • exp2-1
    数据结构(第四版)第二章上机实验题源程序答案详解(Data structure (fourth edition) chapter on lab answer questions Detailed source)
    2014-12-31 09:14:51下载
    积分:1
  • code
    c语言的一些小李子,初学c的朋友有帮助,主要有顺序表、二分查找、二叉树、单链表等等(Some Survival Song c language, c beginner to help a friend, there are sequence tables, binary search, binary tree, a single linked list, etc.)
    2011-08-11 20:50:26下载
    积分:1
  • Josephus
    实现约瑟夫问题的4种算法,并有计时功能进行效率测试(4 algorithms to resolve Josephus Problem with timing counter for testing efficiency)
    2012-12-20 12:36:46下载
    积分:1
  • Monkeys-and-peach
    Monkeys and peach,Monkeys and peach(Monkeys and peach)
    2013-09-01 22:06:42下载
    积分:1
  • tree
    二叉树的先序遍历。采用递归实现。释放资源时用了后序遍历。(Preorder traversal of a binary tree. Recursive implementation. Release resources used after preorder.)
    2013-07-09 13:39:31下载
    积分:1
  • sstring
    利用串来比较数据大小,代码中有两个串,通过串来比较大小( 10/5000 Use the string to compare the data size)
    2016-12-20 17:05:29下载
    积分:1
  • RBtree
    使用C++/C语言实现的红黑树,对于数据结构的学习有所帮助。(Use red-black tree C++/C language for learning data structures helpful.)
    2014-05-16 16:09:57下载
    积分:1
  • BSM
    一个很经典的问题_八数码! 算法速度快,解决问题多...有兴趣的可以(A very classic problem _ eight digital! Fast algorithm to solve the problem ... are interested in more than can be)
    2008-05-04 13:42:30下载
    积分:1
  • 696516资源总数
  • 106459会员总数
  • 0今日下载