lharc压缩算法

有关树的遍历问题-the tree traversal issue

这份是一份压缩解压缩的商业产品的源码JZIP。压缩算法比较不错，值得推荐浏览-this is a compression decompression of the commercial products JZIP source. Compression Algorithm quite good, and worth recommending View

KEIL驱动 各方面各 你的看法女士的烦恼 方看到你 -KEIL you drive all aspects of the views of the President to see the trouble you

Java编写的简单的Mail发送程序，包含了邮件的发送过程，相应过程的演示。 可以被其它Serverlet调用来发送邮件。-Mail procedure ,written in Java to send a simple , contains the e-mail sending process, the corresponding demonstration of the process. Other Serverlet can be invoked to send mail.

电脑鼠走迷宫，包括探索和冲刺。探索部分路径直接返回起点进入冲刺状态 。-Computer Mouse Maze, including the exploration and sprint. A direct return to the starting point to explore some of the path into the sprint the state.

哈夫曼编码树算法-Huffman coding Tree Algorithm

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

这是在项目中，有一个功能是关于《拼音匹配的算法》。至于算法的思想，就不想过多的解释了，大家去看吧 -pinyinsuanfa

显示tiff图像文件，并能显示图像的一些重要参数-Show tiff image file

tar原码，不知道有没有用-tar source was not aware useless