good use of the bus learning the procedures for a closer look it would be helpfu...

自己用C语言编写的NDS掌机运行的贪食蛇游戏，用了PAlib函数库，与大家分享，希望对大家有帮助。。。编译前请先确认安装了devkitPro-Their use of C language running贪食蛇portable NDS games, spent PAlib library to share with you, in the hope that everyone has to help. . . Pre-compiler is installed make sure devkitPro

line rearrangements in php code

这是我已经编译好的GDAL1.4的所有文件，包括动态库文件，静态库文件，头文件。-This is what I have compiled GDAL1.4 all documents, including dynamic library files, static library files, header files.

用cpp自己实现的大富翁小程序，基本实现了诸如移动，造房，分数计算等功能，是一个很好的继续开发的平台。-with the Monopoly achieving his small programs, such as the realization of the basic mobile, Building, scores of calculation functions, is a very good platform for continued development.

钢筋混凝土框架结构设计计算源程序，用vb开发。-reinforced concrete frame structure design source files, using Visual Basic development.

C++ example, 适合初学者。常用的实现方法。对于自学C++而苦于缺少示例模仿的朋友们提供了大量的实例。教材实验设计完全按照C++标准规范，给自学的朋友们提供了好的典范

这是一个改进的人脸识别 算法,希望对大家有用-This is an improvement of face recognition algorithm, it may be useful to hope

交通信号灯管理系统，方便快捷十分好用，具有完善功能-trafficlight

平衡二叉树操作的演示 一、 需求分析 （1） 利用平衡二叉树实现动态查找表。实现查找，插入和删除三种基本功能。 （2） 初始，平衡二叉树为空树，操作界面给出查找，插入和删除三种操供选择。每种操作均要提示输入关键字。每次插入和删除一个接点时，显示更新的平衡二叉树。 （3） 重点在于对删除算法的实现。假设要删除的关键字为X的结点，若X不在叶子结点上，则用左子树中的最大值或者右子树中的最小值取代X。如此反复，直到删除动作传递到某个叶子结点，删除叶子结点时，若要进行平衡变换，可采用插入的平衡变换反变换。 -balanced binary tree operation of a demonstration, demand analysis (1) using a balanced binary tree dynamic lookup table. Lookup, insertion and deletion of the three basic functions. (2) The initial, balanced binary tree is empty tree interface gives you insert and delete options for the three parade. Each operation will have to be me to input keywords. Each insert and delete a contact in that update balanced binary tree. (3), the focus is on the deletion algorithm. To remove the assumption that the keyword for the X-Node, if X is not the leaf nodes, Left-used for the highest tree or right-tree to replace the minimum X. So repeatedly, until the deletion of a transfer leaf nodes, delete the leaf nodes, if balancing transform, Ins

对二维码进行识别，将简单的二维码图像进行剪切，量化，去噪，矫正，最后识别出二维码的信息。