VC++读写FAT32操作源程序请用vc++6.0以上打开

java2 图形设计 卷II Swing，里面包含大量java swing图形设计代码-java2 Graphic Design Volume II Swing, which contains a large number of java swing graphic design code

红外遥控六足爬虫机器人设计，开发的框架，-Infrared Remote Control Reptile hexapod robot design, development framework,

Microsoft ADO 程序员参考-Microsoft ADO programmers reference

产生 S型函数 产生 S型函数 -product a S functionproduct a S functionproduct a S functionproduct a S function

linux命令简介。对Linux有了一点的了解，以己推人，我也深知新手的苦衷，特将一点心得贡献给大家（ 注：我所列出的只是我认为常用的，为便于大家查找，故以字母顺序排列）。-linux brief order. With 1:00 to Linux understanding, pushing people to own, I also knew that novice difficulties. 1:00 UNSCOM experience will contribute to you (Note : I have shown in my view is commonly used to help everyone to find, Therefore, in alphabetical order).

QT3 技术文档，QT公司提供，较权威。-Qt3 technical documentation, QT companies, representing the authority.

VB的学习资料，有利于VB的学习，里面的算法很好，建议-VB-learning materials is conducive to learning VB, which the algorithm is very good, it is recommended to see

VBScript 语言参考&VBScript 教程，对初学者有一定的帮助-VBScript Language Reference

C语言中显示汉字的代码，简单但是有时很常用的哈，麻烦站长尽快通过，我是新手-Chinese Character C language shown in the code, simple but sometimes very commonly used in Kazakhstan, the trouble through the station as soon as possible, I am novice

用堆栈实现迷宫求解问题 基本思想: 若当前位置可以通过,则压入栈中,否则探求下一位置,若走不通,则回朔,迷宫大小:M*N.迷宫设置自定义。 求解迷宫问题的简单方法是：从入口出发，沿某一方向进行探索，若能走通，则继续向前走；否则沿原路返回，换一方向再进行探索，直到所有可能的通路都探索到为止。 为避免走回到已经进入的点（包括已在当前路径上的点和曾经在当前路径上的点），凡是进入过的点都应做上记号。-Maze with the stack to achieve the basic idea for solving the problem: If the current position can be adopted, in pressure, otherwise the next location to explore, if a dead end, then back to New Moon, the size of the maze: M* N. maze set up a custom. A simple maze to solve the problem is: starting from the entrance, along a certain direction to explore, can walk, then continue to move forward otherwise return along the same route, a direction for further exploration, until all possible pathways are exploring to date. In order to avoid going back to have access points (including the current path and current path in the point), all the points should be entered mark.