文件压缩中的游程编码源程序。已经测试通过。对重复字符较多的文件压缩率较高。...

A * (star) Algorithm-A* (star) Algorithm

这是一个兼容C++标准的IO流接口，可以用于访问*.zip文件。（支持 压缩和解压缩）。-This a compatible standard C-IO interface, which can be used to visit*. zip file. (Support for the compression and decompression).

建立完整的赫夫曼树，及各种操作，其数据方法，为字母加空格-The establishment of a complete Huffman tree, and a variety of operations, methods of its data for the letter spaces

doushi jingxuande asfsadfsdaf-safsdafsdafasdfsadfsdfsadfsdfa

压缩用的-Compression used

LZW压缩算法源代码和示例程序代码c-LZW compression calculates the law origin code and demonstration procedure code c

程序通过构建一个haffman树，用哈夫曼树算法对文本文件进行0-1化编码，并模拟文件 压缩与解压-Procedure to build a tree haffman using Huffman tree algorithm to 0-1 on the text file of code, and simulate file compression and decompression

本代码为采用小波基进行图像压缩的代码程序，压缩率可以达到1/32。采用vc编写。-code for the use of wavelet image compression code procedures, compression ratio can reach 1/32. Prepared using vc.

地图着色把地图上的每个城市抽象为一个点，并给每个城市编号，，相邻的城市之间用直线连接。据此做出邻接矩阵，若第i个城市与第j个城市相邻，则metro[i][j]=1,否则metro[i][j]=0。 算法：按照编号从小到大的顺序检查每个城市，对每个城市从1到4使用4种颜色着色，若当前颜色可用（即不与相邻城市颜色相同），则着色；否则测试下一种颜色。 -Map coloring to each city on the map as a point of abstraction, and to every city number, adjacent lines to connect between cities. Accordingly to make adjacency matrix, if the section i and section j cities adjacent cities, the metro [i] [j] = 1, otherwise the metro [i] [j] = 0. Algorithm: In accordance with the code sequence from small to large checks every city, every city on 1-4 from the use of four kinds of color shading, color can be used if the current (ie not with the same colors as the neighboring cities), then coloring Otherwise, the next test colors.

介绍各种压缩的特点以及应用，欢迎大家位下载！-Introducing a wide range of compression characteristics of the application, Welcome to the digital download!