图论经典算法，包括最短路径，最小生成树，强联通分支等

应用背景这个网站已经发展到帮助其他程序员捕获屏幕在他们的应用程序，你可以将它捕获任何时候一些人想保存/更改数据库关键技术VB屏幕捕获机制，利用内置摄像头在你的机器。一般的应用程序使用v.b捕获屏幕

字符串扩展问题的递归算法及动态规划算法的详细分析及实现-implementation and detailed analysis of recursive algorithm and dynamic programming algorithm of string expansion issue

编译程序时使用最短路径,定义类,然后对类的实现,找出最短路径!-compiler to use the shortest path, a class definition, and then the right type and to find the shortest path!

报警信息查询系统VB+ACESS 根据某啤酒厂出现故障不同（如系统错误、负亟接地、操作错误等）计算机系统进行报警-alarm information inquiry system VB Acess under a different breweries failure (such as system error, negative urgent grounding, operational errors, etc.) for the police computer system

数据结构课程的实验之一，有关于数组的循环位移，简单的小程序-Experimental data structure course one of the cycle of displacement on the array, a simple applet

C++数据库管理源代码，连接数据库后，可直接调用里面的函数对数据库进行操作，有修改-C++ Database management source code, database connectivity, you can directly call the function inside the database operation, has modified

RDBMS Design and Implementation: Normalization

计算圆周率 Pi (π)值, 精确到小数点后 10000 位 只需要 30 多句代码！-Pi calculated pi () values, accurate to 10,000 decimal places only need more than 30 sentence code!

实现ADT,可以实现两个二叉树的几种逻辑关系来显示它们之间的联系.如:求两个二叉树是否是等价的.它们的交集并集是怎样的.等等.这样这些都是ADT要实现的方法.-achieve ADT, can achieve two binary tree several logical relationship to show the linkages between them. Such as : whether the binary tree for two are synonymous. The intersection of what is the set. And so on. ADT then these are the methods to achieve.

hanoi