Simple Receipt Print

共26章,对Windows的许多内部机制有很好的剖析-A total of 26 chapters, many of the Windows internal mechanism has a very good analysis

Static Control program

LPC2368的头文件，初学者一定要看的哟-LPC2368 the first document, beginners must look at the yo

本程序可以查看已编译好的资源文件中的图片-this program can check resources has been compiled in the document Photo

求图中从一个顶点到另一个顶点的一条路径。 //为简化算法，没有提供顶点到其编号的转换函数，函数Path_vtou(ALGraph G,VexIndex v,VexIndex u) //中两顶点参数用的是顶点的编号；函数Printpath(ListType Path)输出的是路径上的顶点编号序列-seeking a map from the vertex to another vertex of a path.// To simplify the algorithm, not to its peak numbered conversion, function Path_vtou (ALGraph G, VexIndex v, u VexIndex)// 2 vertex parameters of the number of vertices; Function Printpath (ListType Path) output is on the path to the peak numbers Sequence

clock program using OpenGl with C-clock program using OpenGl with C

八皇后VC图形演示，算法思想：回溯法，先在第1行放上一个皇后，然后在第2行合适的位置放上一个皇后，依次类推，如果8行都放满了，说明找到了一个解，如果第好第i行的皇后后，第i+1行找不到合适的位置，这时就回到第i行，把第i行的皇后放到下一个位置，继续尝试下一行。如此反复，知道找到所有的解。注意，这种算法找的解可能有等价的，某些解可由别的解经过旋转棋盘得到。-visual demostration in vc of eight queens problem. algorithm: backtracking. First, put a queen on first line then find a suitable position on 2nd line for next queen, and so on. When all eight lines have queens, it means we have find a solution. If we put the i-th queen, but can find a suitable position on the (i+1)th line, then back to the ith line and move the queen on the ith line to next suitable position and move on to the next line. Repeat this until we have found all the solutions. Note:By this mean, some solutions maybe equivalent to others, some can be acquired by the rotation of other solutions.

一个在国外网站下的语义相似度程序，开源代码，随便下载-Abroad under a web of semantic similarity procedures, open source code, not download

Masm Error View for Visual Studio 2008

opengl入门的例子，希望对初学者有用-Examples of entry-opengl, I hope useful for beginners