拉斯维加斯，KMP模式匹配算法，mentro Carlo三的原始股份有限..

一个自己编的ODBC数据库的程序。-a series of the ODBC database procedures.

用从c＋＋写的floyd最短路径算法，可以求邻接矩阵任意两点的最短路径。-from using c++ to write the Floyd shortest path algorithm, can help adjacency matrix arbitrary 2:00 Shortest Path.

重言式是当所有逻辑变元取遍所有值时都为真的表达式。这个程序是用来对重言式进行判别的！还可以吧！牛人别见笑！-tautology is when all logic variables take out all values are true expressions. The procedure is used to tautology runs! Also! Other cattle were laughed at!

一个关于多重网格的程序，解得是一个周期的非线性方程，当然也可以换成其他边界的-a grid of multiple procedures, that there is a solution to the cycle of nonlinear equations, of course, could be replaced with other border

哈夫曼树算法 根据给定的n个权值{w1,w2,……wn}，构造n棵只有根结点的二叉树，令起权值为wj 在森林中选取两棵根结点权值最小的树作左右子树，构造一棵新的二叉树，置新二叉树根结点权值为其左右子树根结点权值之和 在森林中删除这两棵树，同时将新得到的二叉树加入森林中 重复上述两步，直到只含一棵树为止，这棵树即哈夫曼树 -Huffman tree algorithm based on a given n-weights (w1, w2, ... ... wn), construct n trees only a root node of the tree, so that from the right value of wj in the forest root node to select two the right tree for the value of the smallest subtree around, a new binary tree structure, the right to buy a new tree root node value of its subtree root node around the right value in the forest and delete these two trees, At the same time, the new binary tree obtained by adding the forest to repeat the above two steps until a tree containing only the date, that is, Huffman tree tree

db2建库代码和开发文档 帮助初学者更好的学习db2-db2 database code and the development of documentation to help beginners better learning db2

完全采用指针编写的字符串排序程序，共两种方法，调试过-completely prepared by the string pointer ranking, with a total of two methods tuned

这是本人精心搜集的关于常用图论算法的一套源码，代码内附注释，可供需要的朋友作为参考-carefully collected on the graph algorithm commonly used in a set of source code, code contains Notes the need for a friend as a reference

用PB设计的前台界面-with the prospects PB interface design

是一个在学习数据结构时编写的图结构，主要是用两种方法生成需要的图结构，其中有一个头文件都注释了，要是要使用的话，只需要将另一个头文件注释并把这个取消注释，在main方法中改一个类名就好了-Is a data structure in the learning plan to prepare the structure, is mainly used two methods to generate the need for the graph structure, in which there is a header file are annotated, if you want to use words, just another header file to the Notes and the cancellation of Notes, in the main method to a class name like the