java的一个小程序共给大家风箱 ！

水平有限，请高手们指点一下哪里可以改进，或者有更好的方法-limited, and 19:56 gets advice on where they can improve, or there is a better way

java实现zip文件压缩解压，功能封装在一个类中，支持中文及多级目录，可以一直移植windows和unix上使用，包中提供了源代码及代码中用到的外部包-java realize extracting zip file compression, functional class in a package to support Chinese and multi-level directory, you can always transplant the use of windows and unix, package provides the source code and the code used in the external packet

用JAVA语言实现最简单客户机和服务器功能.-with Java language the most simple client and server functionality.

一个压缩程序和一个解压程序-a compression procedures and a decompression procedures

用回溯法解决不是很麻烦的传教士和野人问题-By backtracking to solve is not very troublesome issue of missionaries and Savage

这是一个关于统计压缩的算法，包含压缩和解压缩的源码，使用VC些的，而且包含测试过程。-This is a statistical compression algorithms, including compression source code, the use of VC more, but includes the testing process.

这个是一个多媒体的压缩与解压的软件源码 采用的是行程编码的 看看吧-This is a multimedia compression and decompression software using the source code look at the itinerary it

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

程序功能：模拟DCT编码解码过程，生成带“块效应”的图像 实验图片：lena.jpg(512*512)-Program features: Analog DCT codec process, generated with

gif图像的编解码实现，在vc环境下直接编译即可！-realization of gif graphic compression/decompression,which can be compiled in VC environment.