文件名称:Huffman

  • 所属分类:
  • 3D图形编程
  • 资源属性:
  • [Windows] [Visual C] [源码]
  • 上传时间:
  • 2012-11-26
  • 文件大小:
  • 17kb
  • 下载次数:
  • 0次
  • 提 供 者:
  • 游***
  • 相关连接:
  • 下载说明:
  • 别用迅雷下载,失败请重下,重下不扣分!

介绍说明--下载内容均来自于网络,请自行研究使用

迄今为止见过的最方便的huffman编码,效率很高

一个外国人写的,很具有研究价值

Constructing a Huffman Tree according to the number of times each symbol appears in the data stream:

1)  Create an array of N nodes, representing N possible symbols (ranging between 0 and N-1).

2)  Set the value of each node to the number of times that its symbol appears in the data stream.

3)  Create a Minimum-Heap of N nodes.

4)  Add every node whose value is greater than zero to the heap.

5)  Extract the best two nodes in the heap.

6)  Create a parent node whose children are the two extracted nodes.

7)  Add the parent node to the heap.

8)  Repeat the previous three steps N-1 times (until only 1 node remains in the heap).

9)  Extract the last node in the heap.

The array created in the first step stores the leaves of the tree, and is used in order to encode the data stream.

The node extracted in the last step is in fact the root of the tree, and is used in order to decode the data stream.-So far seen the most convenient huffman coding, efficient write a foreigner, I have research value Constructing a Huffman Tree according to the number of times each symbol appears in the data stream: 1) Create an array of N nodes , representing N possible symbols (ranging between 0 and N-1) .2) Set the value of each node to the number of times that its symbol appears in the data stream.3) Create a Minimum-Heap of N nodes.4) Add every node whose value is greater than zero to the heap.5) Extract the best two nodes in the heap.6) Create a parent node whose children are the two extracted nodes.7) Add the parent node to the heap.8) Repeat the previous three steps N-1 times (until only 1 node remains in the heap) .9) Extract the last node in the heap.The array created in the first step stores the leaves of the tree, and is used in order to encode the data stream.The node extracted in the last step is in fact the root of the tree, and is used in order to decode the data stream.
(系统自动生成,下载前可以参看下载内容)

下载文件列表

Huffman

.......\Decoder.cpp

.......\Decoder.h

.......\Encoder.cpp

.......\Encoder.h

.......\FileReader.cpp

.......\FileReader.h

.......\FileWriter.cpp

.......\FileWriter.h

.......\Heap.cpp

.......\Heap.h

.......\Huffman.doc

.......\Huffman.dsp

.......\Huffman.dsw

.......\Info.cpp

.......\Info.h

.......\Leaf.cpp

.......\Leaf.h

.......\Main.cpp

.......\Node.cpp

.......\Node.h

.......\Root.cpp

.......\Root.h

.......\Tree.cpp

.......\Tree.h

相关说明

  • 本站资源为会员上传分享交流与学习,如有侵犯您的权益,请联系我们删除.
  • 本站是交换下载平台,提供交流渠道,下载内容来自于网络,除下载问题外,其它问题请自行百度更多...
  • 请直接用浏览器下载本站内容,不要使用迅雷之类的下载软件,用WinRAR最新版进行解压.
  • 如果您发现内容无法下载,请稍后再次尝试;或者到消费记录里找到下载记录反馈给我们.
  • 下载后发现下载的内容跟说明不相乎,请到消费记录里找到下载记录反馈给我们,经确认后退回积分.
  • 如下载前有疑问,可以通过点击"提供者"的名字,查看对方的联系方式,联系对方咨询.

相关评论

暂无评论内容.

发表评论

*主  题:
*内  容:
*验 证 码:

源码中国 www.ymcn.org