登录
首页 » Visual C++ » huffman_tree

huffman_tree

于 2013-12-28 发布 文件大小:10KB
0 219
下载积分: 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 个回复

  • KMP---MFC
    数据结构里面的KMP算法的可视化演示程序 MFC实现(Visualization of data structures inside the KMP algorithm demo program MFC implementation)
    2020-07-04 08:40:01下载
    积分:1
  • C-data
    大一c语言实验的所有源码以及实验报告报告(All source code and report experimental freshman c language)
    2016-12-23 23:43:39下载
    积分: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
  • zhebanchazhao
    实现折半查找,非递归形式,从而实现数据结构所要的结果。(To achieve binary search, the non-recursive form)
    2012-08-29 12:35:25下载
    积分:1
  • yeschengxu
    这是数据结构很重要的程序,主要是课后题的答案,和代码,功能很强大(the data struct of the book)
    2013-12-22 23:25:14下载
    积分:1
  • Huffman
    数据结构,利用霍夫曼树实现文本数据的压缩。(Huffman data compression and decompression.)
    2014-01-28 18:25:24下载
    积分:1
  • Dynamic-Memory-Allocation
    这个程序是有关计算机的动态内存分配的数据结构 可以直接加载头文件与源文件即可使用其中的接口(This program is a data structure for dynamic memory allocation of the computer can directly load the header files and source files you can use one of the interfaces)
    2012-05-22 16:36:13下载
    积分:1
  • 48qqqq
    主要用栈和树求解骑士问题,用C++语言编写的(The main stack and tree Cavalier Problem Solving with C++ languages)
    2009-03-21 22:34:39下载
    积分:1
  • 有向图的邻接表存储的实现graph
    有向图的邻接表存储的实现,包括有向图的各种操作(Directed graph adjacency list storage implementation, including a variety of operations to the map)
    2020-07-16 10:38:50下载
    积分: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今日下载