登录
首页 » Visual C++ » huffman_tree

huffman_tree

于 2013-12-28 发布 文件大小:10KB
0 215
下载积分: 1 下载次数: 3

代码说明:

  数据结构学习中提供的不错的源码,一个哈夫曼树类,利用了链队列存储结构。压缩包中有七个文件。(Data structure provided a good learning source, a Huffman tree class, the use of the chain queue storage structure. There are seven compressed file.)

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

发表评论

0 个回复

  • radixsort
    对首先产生20个随机数进行基数排序,是利用C++实现的(On the first 20 random numbers generated for the base sequencing is the use of C++ Realize the)
    2007-10-16 19:11:53下载
    积分:1
  • NewCode
    清(英文)常见数据结构,代码实现,值得下载,值得分享(Qing (English) common data structure, code implementation, worth downloading, worth sharing)
    2012-11-21 14:33:49下载
    积分:1
  • CarClass
    数据结构简单的课程设计交通换乘算法,里面有零次换乘与一次换乘(Simple structure, curriculum design data traffic transfer algorithm, which have zero time transfer and a transfer)
    2011-01-09 10:33:14下载
    积分:1
  • Sort
    排序,各种排序算法,插入排序,冒泡排序,快速排序,等等!(Sorting, various sorting algorithms, insertion sort, bubble sort, quick sort, and more!)
    2011-05-08 00:09:13下载
    积分:1
  • 851DataStructure2009
    江苏大学数据结构研究生试题2009Jiangsu University graduate examination papers(Jiangsu University graduate examination papers)
    2011-09-25 11:51:05下载
    积分:1
  • BFS
    迷宫问题 队列求解 界面还不完善 可以自己添加(Maze problem solving interface queue is not perfect you can add your own)
    2013-12-26 22:08:58下载
    积分:1
  • 哈夫曼树解码和编码
    哈夫曼树,基本的数据结构,用来编码和解码、用数组作为存储结构实现,
    2023-04-13 11:00:11下载
    积分:1
  • huffman_src22
    本代码提供一种非常简单且快速的哈夫曼编码方法。 (this code provide a very simple and rapid method of Huffman coding.)
    2007-06-15 16:02:25下载
    积分:1
  • AOV-Sort-Algorithm
    使用C语言编写的AOV网的拓扑排序,内附有详细的源码解释和输入示意图(Using C language AOV network topological sorting, enclosing a detailed explanation and input source diagram)
    2011-10-26 16:34:29下载
    积分:1
  • Kruskal
    克鲁斯卡尔算法思想.cpp int seekedge(EDGE * (&a), int n) void bubble(EDGE * (&a), int size) void searchandjoin(EDGE * (&a1), int k) // a1是图边集头指针,a2是最小生成树边集的头指针,k为所要删的边 void storepicture(EDGE * (&a), int n, VERTEX *b, int m) (Thinking of Kruskal algorithm. Cpp int seekedge (EDGE* (& a), int n) void bubble (EDGE* (& a), int size) void searchandjoin (EDGE* (& a1), int k) // a1 edge set is the first pointer map, a2 is the minimum spanning tree of the first indicators margination, k for the edges to be deleted void storepicture (EDGE* (& a), int n, VERTEX* b, int m) )
    2009-06-27 01:43:39下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载