在MFC应用程序查看PDF、Word文档文件

visual Basic game progrmming example

这是关于运筹学，博弈问题的算法程序！您只要输入对策矩阵就性了-on tacticians, the game of the algorithm! Your input on the sexual response of the matrix

网络爬虫程序，可以支持多线程同时爬行处理-Reptiles procedures to deal with multi-threaded

通过java编程实现对图的搜索，最终得到代价最小的路径 文件中有源代码 也有测试程序 本人亲自验证过了 可以实现 如果有能力者 可以将之改变成路径搜索的方法 我能力不足 期待您的改编

银行叫号系统，用户排队拿好各个窗口随即的号码，工作窗口依照号码叫号，还以察看一天的叫号情况-Bank called its system, the user queue window then Collect all of the numbers, in accordance with the job number is called its window, but also to see the situation of the day called No.

采用邻接矩阵表示无向图，完成图的创建、图的深度优先遍历、图的广度优先遍历操作。其中图的顶点信息是字符型，图中顶点序号按字符顺序排列。本输入样例中所用的图如下所示： Input Format: 第一行输入两个值，第一个是图中顶点的个数，第二个是图中边的条数 第二行输入各顶点的信息，即输入每个顶点字符 第三行开始输入每条边，每条边的形式为两个顶点的序号，中间以空格隔开，输入完一条边换行 Output format: 首先输出图的顶点信息，输出完毕换行 接着输出图的邻接矩阵，假如图中有n个顶点，则输出形式为n行n列的邻接矩阵，输出完毕换行 接下来一行输出从图的第一个顶点开始进行深度优先遍历的序列，中间以空格隔开，输出完毕换行 最后一行输出从图的第一个顶点开始进行广度优先遍历的序列，中间以空格隔开，输出完毕换行 -Using an undirected graph adjacency matrix representation to complete the map creation, graph depth-first traversal, graph breadth-first traversal operation. In which vertex information is character, the graph vertex number by characters in order. The input sample used in the diagram are as follows: Input Format: The first line of input two values, the first one is the number of graph vertices, the second one is the number of graph edges Second row, enter information in each vertex, that enter each vertex character Start typing in the third line of each side, each side in the form of two vertices

淡入淡出效果的简单实现 淡入淡出效果的简单实现-Fade out of the simple effect of achieving results Fade out of the simple realization

数据结构！实现优先数调度算法！大家多多支持-Data structure! Priority scheduling algorithm to achieve a few! We can support! ! !

一个嵌入式系统的生物识别的MS通用接口LAP源码-a biometric identification system MS General Interface LAP FOSS