资源列表
MSC1201ADC
- 此程序是ＭＳＣ１２０１工程评估板ＭＣＵ原代码．此芯片精度高．内部包含ＭＣＵ-This procedure is MSC1201 engineering the original code MCU Evaluation Board. This chip and high accuracy. Contains the internal MCU
VFW
- 显示电子管时间-Display tube time
hafuman2
- 此霍夫曼编码可根据自己输入的字符集及频度构建霍夫曼树，利用建好的哈夫曼树生成哈夫曼编码．-This Huffman code can be entered in accordance with their own character set and the frequency of Huffman tree constructed using built Huffman tree generated Huffman.
textedit
- 这是一个解决文本编辑的源码，希望对大家有所帮助。-This is a solution to the source text editor, I hope all of you to help.
code
- 给定电文进行哈夫曼编码，给定编码进行哈夫曼译码，要求电文存储在文件1中，编码后的结果存储在文件2中，给定编码存储在文件3中，译码后的结果存储在文件4中。-Given the message Huffman, given Huffman code decoding request message is stored in the document 1, the result of coding is stored in the document 2, a given code is stored
2008121502
- 730904374X 73 0904374X -730904374X 73 0904374X
HMLZW
- this a haffman code that can compress any file.
Minium_Spanning_Tree(Kruskal)
- 最小生成树问题 问题描述：若要在ｎ个城市之间架设通讯网络，只需要架设ｎ－１条线路即可。如何以最低的经济代价建设这个通讯网，是一个网的最小生成树问题。 设计要求：利用克鲁斯卡尔算法求网的最小生成树；以文本形式输出生成树中各条边以及它们的权值。 -The issue of minimum spanning tree problem Descr iption: n To set up a communication network between cities, only need to
AMR(2009.1.9)
- TS 26.104 3GPP AMR音频文件压缩、解压算法-TS 26.1043GPP AMR audio file compression, decompression algorithm
huffman
- 问题描述] 利用哈夫曼编码进行信息通信可以大大提高信道利用率，缩短信息传输时间，降低传输成本。但是，这要求在发送端通过一个编码系统对待传数据预先编码，在接收端将传来的数据进行译码（复原）。对于双工信道（即可以双向传输信息的信道），每端都需要一个完整的编/译码系统。试为这样的信息收发站写一个哈夫曼编/译码系统。-Descr iption of the problem] use Huffman encoding of information and communication can grea
CompressDll
- 具有数据压缩和解压缩功能的地动态库。 采用Delphi内置的压缩库实现。压缩效率略低于zip。-With data compression and decompression functionality to dynamic libraries. The use of Delphi
newsoccerleague
- 在线足球社区，支持球员增删改查，球队增删改查-Online football community, to support the player additions and deletions to the investigation, the team additions and deletions to search