登录
首页 » Visual C++ » huffman

huffman

于 2010-05-24 发布 文件大小:2KB
0 156
下载积分: 1 下载次数: 3

代码说明:

  数据结构(严蔚敏版)中哈夫曼树的操作程序源代码(Of data structure (Yan Wei Min version) operating procedures in the source code Huffman tree)

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

发表评论

0 个回复

  • ANT
    A*算法通过启发式探索下一结点,逐步逼近目标结点,且使得路径最短。(A* algorithm heuristic to explore the next node, and gradually approaching the target node, and that the shortest path.)
    2012-05-17 09:14:21下载
    积分:1
  • LStack
    堆栈实现C++,以VC++环境为准——逍遥大洋至上(The stack of the C++, VC++ environment will prevail)
    2012-03-26 08:35:26下载
    积分:1
  • a
    说明:  100米比赛排名 C++实现100米比赛排名 C++实现(100m rankings C++, the 100 meters ranks C++,)
    2010-11-19 23:24:18下载
    积分:1
  • migong
    简单的迷宫问题,有点土,还望大家多指点指点,在此感激不尽。(????? mad spasm, ? Tang Gao, ? oligonucleotide ??? Ning Ning ? ?, Hitomi ?????.)
    2008-07-05 00:11:37下载
    积分:1
  • stack-link
    简单的一个链栈.即用链表实现的一个栈。可以做简单的插入、删除、查找等操作(this is a simple C++ program )
    2014-05-28 20:12:28下载
    积分:1
  • deep-copy
    该代码实现了深拷贝的问题,对于深拷贝进行了一系列的介绍,并且显示其与浅拷贝的区别。(A deep copy of the code issues a series of deep copy for presentation, and shows the difference between a shallow copy.)
    2014-01-03 10:46:48下载
    积分:1
  • EightQueens
    数据结构与程序设计中的重点例子程序:八皇后问题(Data structure and procedures of the focus of the design example of the procedure: eight queen problem)
    2009-06-29 14:52:11下载
    积分:1
  • EightQueen
    经典的 数据结构问题 八皇后问题。问题是在8*8的棋盘上放置棋子,要求每条直线上不能出现两个或以上的棋子。(The classical data structure problem Eight queens problem.Question is placed on the 8* 8 board piece, requirements on each line cannot appear two or more pieces.)
    2016-11-23 10:30:11下载
    积分:1
  • Well-tested-algorithm
    效验算法单循环链表,这些都是实用经典的算法和数据结构(Well-tested algorithm round robin list, these are practical classic algorithms and data structures)
    2011-08-02 12:20:21下载
    积分:1
  • backtrackng
    给定n种物品和一背包。物品i的重量是wi>0,价值为vi>0,背包的容量为c。选择装入背包的物品,使得装入背包中物品的总价值最大。(Given n kinds of goods and a backpack. Weight of the item i is wi> 0, the value of vi> 0, knapsack capacity c. Select the items into the backpack, so into the backpack of items in the total value of the maximum.)
    2017-01-01 17:51:23下载
    积分:1
  • 696518资源总数
  • 105562会员总数
  • 1今日下载