新的RLE压缩算法，在医院MIS中处理US图象时非常有用。

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

压缩工程文件打包源码-compression works documents packaged source

开发的两个小波变换函数对图像进行小波变换-The development of both the wavelet transform function of image wavelet transform

this is a huffman tr-huffman tree

用C++实现的学生信息管理系统，实现了学生和老师的创建，添加，删除和查找，统计，界面设置飞入界面，更加人性化-With C++ Realize student information management system, students and teachers to create, add, delete, and search, statistics, interface set to fly into the interface more user-friendly

a开头和a结尾的字符串-a beginning and the end of a string

把链表S中从第m个元素起共n个元素存储到s中，成功返回1，否则返回0int LEN(STRING S) -S in the list from the first m elements from a total of n elements stored in the s successful one back, otherwise return 0int LEN (STRING S)

That is, can understand the principle of Huffman coding, you can understand the image compression technology

huffman编码演示程序-Huffman coding Demonstration Program.

这个代码是"高斯克吕格与经纬度坐标值转换代码",本人也是从网友转贴而来.-This code is