登录
首页 » Visual C++ » huffman

huffman

于 2013-07-15 发布 文件大小:4KB
0 156
下载积分: 1 下载次数: 1

代码说明:

  使用C语言完成党的霍夫曼编码,主要使用树的数据结构,作为巩固数据结构的练习(Using the C language to complete the party' s Huffman coding, the main use of the tree data structure, data structure as a consolidation exercise)

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

发表评论

0 个回复

  • strcon
    对于给定的n个字符串,请找出一种最佳的连接方式,使得采用该连接方式得到的字符串在所有连接的结果中,字典序最小(For a given n-string, find an optimal connection, making use of the connection string to get the results in all connections, the lexicographic minimum)
    2011-09-02 16:52:40下载
    积分: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
  • Insert
    POJ 字符串的插入 可以将一定长度的字符串插入之前给出的字符串之中(POJ string can be inserted into a length of string into a string before being given)
    2013-11-21 23:27:17下载
    积分:1
  • DouglasPeucker
    道格拉斯—普克法(Douglas—Peucker)的C++程序(Douglas- Puck method (Douglas-Peucker) of the C++ program)
    2011-08-28 19:04:29下载
    积分:1
  • cPP
    数据结构课设,城市地铁站的设计与使用规划(Set data structure class, subway station design and use of planning)
    2011-07-03 11:58:24下载
    积分:1
  • a
    说明:  进程死锁.资源分配图的绘制 建立所需数据结构;  使用题目21存成的资源分配图的文件作为输入;  编写资源分配图化简算法;  每化简一步,在屏幕上显示化简的当前结果;  最后给出结论,是否死锁,如思索给出死锁的进程及资源; (Process deadlock. Resource allocation mapping  establish the required data structures  Use title 21 deposit into resource allocation graph file as input  writing resource allocation map simplification algorithm  Each simplification step, on-screen display simplification of the current result  Finally, the conclusion of a deadlock, deadlock is given as thinking processes and resources )
    2013-07-04 19:50:58下载
    积分:1
  • suanfa
    插入排序与合并排序的算法比较,比较两种算法的优劣(Comparison of insertion sort and merge)
    2011-12-13 22:28:33下载
    积分:1
  • shujujiegoukechengshiji
    数据结构课程设计时,所需的封面及任务书版面,希望对大家有点用!(Curriculum design data structure, the necessary task of the book cover and layout, in the hope that we are a bit used!)
    2008-06-16 18:38:51下载
    积分:1
  • graph-DFS
    邻接表存储图,然后进行深度优先遍历及广度优先遍历。(DFS,adjacent matrix)
    2013-10-27 20:16:41下载
    积分:1
  • stuctures
    本系统采用C语言编写,利用邻接链表实现最短路径问题,关键路径问题等(The system uses the C language, using adjacency list realize the shortest path problem, critical path issues)
    2008-05-29 21:11:26下载
    积分:1
  • 696518资源总数
  • 105873会员总数
  • 12今日下载