采用zlib标准的压缩源码，应用在Windows和Linux多平台下，分别有Linux下和Windows下VC的使用实例。...

gzip源码，用于压缩，在unix下使用的主流压缩工具，建议参考-it is used to compact files in unix.It is recommended.

RAR源码相关，用于编写压缩算法-RAR-related source for the preparation of compression algorithm

lz77压宿算法,用c语言实现,可以在tc下编译通过,根据不同的计算机要修改下相关的参数值,对文本数据的压缩效果很好-lz77 places pressure algorithm, using the c language, in tc under compile, based on different computers to be amended under the relevant parameters, the text data compression with good results

我就不做什么介绍了.你们打家假如要管理系统的话就下下来自己看吧-I do not what to do the introduction. If you play at home to manage the system, then on the next down and see their own

哈弗曼编码的C++实现，包括多个实用头文件-Huffman-coded C++ implementation, including a number of practical header files

2纬下正方自规避随机行走,采用蒙德卡罗方法计算其指数-randomwalk Monte Carlo

c编程技巧１００之１-100 of 1

这是个解压缩软件UNZIP的C源程序代码 ，请站长接收-This is a decompression software UNZIP C source code, the receiving station

关于zip于unzip的源码，c语言实现-to unzip zip on the source, c Language

地图着色把地图上的每个城市抽象为一个点，并给每个城市编号，，相邻的城市之间用直线连接。据此做出邻接矩阵，若第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.