自动停靠的窗口（带讲解）

Source code for control of a machine to measure the accuracy of electric meters by optically reading the meter revolution.

经典Ｃ源程序100例.txt。该程序集深入浅出，适合各种层次的编程爱好者学习和研究。-100 cases of classic C source. Txt. Set the program easy for enthusiasts at all levels to learn programming and research.

用于Web抽取,是一个非常有用的程序，对程序开发有帮助。-It is used for WebExtrator!On Computing Mobile Agent Routes for Data Fusion in Distributed Sensor Networks

Mathematic Expression Evaluator Final

求阶乘算法（0---10000）标准C++语言控制台应用程序 可能很多人都曾经想过要实现一些比较大的数的阶乘，但是C++中提供的标准数据类型其存储空间太小，根本无法实现。我们可以通过其他方法来实现，本程序用一个很简单的算法实现数的阶乘，程序很短，也很简单，各处都有注释，相信大家很容易就可以看懂，下载源码后在VC6.0中打开编译后即可运行，程序经少许改动可以实现更大的数的阶乘，有兴趣的读者在看完本程序后可一动手试试，其乐无穷！！希望这个程序能给大家一点帮助-The arithmetic for counting factorial(0-10000) This is a standard C++ language console application, many people could want to relize the factorial of some large numbers, but the memory space of the standard data type provided by the C++ is too small, so it can not realize at all. But we can realize it by other method, the program realize the factorial of the number you give by a simple arithmetic ,this is a short and easy program, and there are remarks everywhere, I believe that everyone can easily understand it, after downloading the sound code you can open it in VC6.0, then edit and run it. you also can change something to realize the factorial of a larger number, the reader who is interesting in it can have a try, there are more happiness in it!! At last,

visual C++实现基于IE内核的简单的网页浏览功能-visual C++ realize based on the IE core simple Web browser functionality

多线程编程使用方法- Multi-thread programming application method

软件自动升级程序-automatic software upgrade

Description: 采用邻接表表示有向图，完成图的创建、图的深度优先遍历、图的广度优先遍历操作。其中图的顶点信息是字符型，图中顶点序号按字符顺序排列，边的输入按照边的顶点序号从小到大的顺序排列，如下图的边的输入顺序为0 1，0 2，0 3，1 2，1 3，2 4，3 4共七条边，邻接表的边结点采用头插法。本输入样例中所用的图如下所示： Input Format: 第一行输入两个值，第一个是图中顶点的个数，第二个是图中边的条数 第二行输入各顶点的信息，即输入每个顶点字符 第三行开始输入每条边，每条边的形式为两个顶点的序号，中间以空格隔开，输入完一条边换行 Output format: 首先输出图的顶点信息，输出完毕换行 接着输出图的邻接表，格式为首先输出第一个顶点，接着输出该顶点的所有的临界点的序号，换行，然后输出下一个顶点及邻接点，以此类推 接下来一行输出从图的第一个顶点开始进行深度优先遍历的序列，中间以空格隔开，输出完毕换行 最后一行输出从图的第一个顶点开始进行广度优先遍历的序列，中间以空格隔开，输出完毕换行 -Description: Adjacency list using said directed graph to complete the map creation, map of the depth-first traversal, breadth-first graph traversal operations. In which vertex information is character, the graph vertices in order arranged by character number, while the input side of the vertex according to serial number from small to large order, the following graph of the input side of the order of 0 1,0 2,0 3,1 2,1 3,2 4,3 4 a total of seven edge, the edge-node adjacency list using the first interp

这是一个迷宫游戏1.-This a maze game 1.