判断外部程序启动没有 判断外部程序启动没有

通过循环实现线条的渐变,实现方法是一个像素一个像素地画线-cycle through the gradual realization of lines to achieve a pixel is a pixel Draw Line

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

这是网上找的h.264的实现代码,编译通过,可用-This is the Internet looking for the realization of the h.264 code, compile, available

图像处理程序 图像压缩解压编码cho1-ch09处理-Image processing procedures for image compression decompression coding cho1-ch09 treatment

doushi jingxuande asfsadfsdaf-safsdafsdafasdfsadfsdfsadfsdfa

这是一组JPEG解码指令和源代码，详细描述了文档开头部分

开发环境是CCS，在DM642平台上实现H.263编解码-CCS is a development environment in DM642 platform to achieve H.263 codec

队列应用-求迷宫问题-Queue application-seek maze problem

实现JPEG的压缩和编码 （1）首先通过DCT变换去除数据冗余； （2）使用量化表对DCT系数进行量化； （3）对量化后的系数进行Huffman编码。 -The realization of JPEG compression and coding (1) First of all, through the DCT transform to remove data redundancy (2) the use of quantization table of quantization DCT coefficients (3) of the coefficients after quantization Huffman coding.

Marvell8686 source code