分页脚本

设计一个项目，排出AOE网络，并将数据输入计算机，用程序进行分析。-Design a project, from AOE network, and data entered into the computer, using the procedure for analysis.

动态规划入门问题：导弹防御 的解答与源程序，包含样例输入与输出-Introduction to dynamic programming problems: answers and the source of missile defense, including sample input and output

数据结构经典算法的实现-data structure to achieve the classical algorithm

遍历邻接表以及执行邻接矩阵布尔调整是数据结构里图的经典算法。- Traverse the adjacent table and adjust the implementation of Boolean adjacency matrix data structure is a classic graph algorithm.

简单的servlet/jsp注册，包括三个页面和一个servlet,虽然小一点，但是框架比较全，表单验证的js没写了，希望用的时候自己加上-Simple servlet/jsp Register, including the three pages and a servlet, although smaller, but the whole framework of comparison, the form validation js did not write, and hope to use the time to add their own

MyDB 是一个小型、 快速、查询方便的桌面数据库。 适用于Visual C++、Visual Basic、Delphi等开发者。 只有一个DLL（188KB），所有数据以自己的格式存 在一个普通文件中，无需Dao、Ado、BDE等支持。 也无须任何安装和设置。特别适合开发那些数据量 不是很大，无需复杂查询，又不想安装Dao等一大堆 DLL，OCX的绿色软件。而且数据安全性好， 无法轻易打开！-MyDB is a small, fast and convenient desktop database query. Applies to Visual C++, Visual Basic, Delphi and other developers. There is only one DLL (188KB), all data in their own format, there is a general document, without Dao, Ado, BDE and other support. Also without any installation and settings. Particularly suitable for the development of those who is not a big amount of data without the complexity of inquiries, but also do not want to install a lot of Dao, such as DLL, OCX green software. And data security, and can not be easily opened!

1，图的建立与遍历操作 建立图的邻接矩阵 输出图从顶点V0出发按深度优先遍历的顶点序列 输出图从顶点V0出发按广度优先遍历的顶点序列 2，图的建立与拓扑排序-1, Graph traversal operation with the establishment of the establishment of the adjacency matrix output plans starting from the vertex V0 by depth-first traversal sequence of vertices losers Figure out from the starting point V0 according to the breadth- first traversal sequence vertex 2, and plans to establish the topological sorting

二叉树的动态链表存储结构及表示，二叉树的三种遍历算法（递归和非递归两类）运用二叉树三种遍历的方法求解有关问题-Binary tree structure and the dynamics of linked list is stored, said three kinds of binary tree traversal algorithms (recursive and non-recursive types) the use of three kinds of binary tree traversal of the method for solving the problem

labyrinth: you need to find the doable way to go to the destinaton.And then print out the path.-labyrinth: You need to find the doable way to go to the destinaton.And then print out the path.

64位以内Rabin-Miller 强伪素数测试和Pollard rho 因数分解算法的实现-64 within Rabin-Miller-puppet prime testing and Pollard rho factorization algorithm implementation