操作节点，非常好

由于简单模式匹配算法在一次字符比较失败后，简单的把模式串位置向前移动一个字符位置，这样就丢掉了前面字符匹配中得到的信息，效率差。所以就需要一种无回溯的算法来提高效率，这里使用KMP（Knuth-Morris-Pratt）算法。模式串前面的连续片断部分称“前缀模式”，前缀模式在模式串后部重复出现的情况可以用来避免重复进行已经做过的检查，这是KMP算法中的一个重要概念。-as simple pattern-matching algorithm to compare a character failure, a simple model put forward position Series mobile location of a character, would be lost in front of characters matching the information inefficiently. There is a need for a non-backtracking algorithms to improve efficiency, the use of KMP here (Knuth-Morris-Pratt) algorithm. Model Series in front of a row clips part said "prefix model," prefix string pattern in the pattern of recurring back can be used to avoid duplication of inspection has been done, KMP algorithm is an important concept.

对文件进行文本文件处理 并采用递归法把查到的信息插入到树中-a file processing program, process a file and insert the information from the file to a tree

一个图形学和数据结构作业文档和实现代吗-Graphics and data structure of a document and the realization of operating on behalf of you

SQLite的包装库的源代码，4.7版本可与最新的PBWIN编译器中使用

db2日常维护汇总-db2 routine maintenance Summary

界面美观,模块功能清晰,连接数据库,适合初学者-Beautiful interface, the module features a clear, connected databases, suitable for beginners

用普里姆（Prim)算法求用邻接矩阵存储结构表示的图或网的最小生成树-With the prim algorithm is seeking to use adjacency matrix storage structure, said the plan or network, minimum spanning tree

主要是数理方程基本框架很有用,对数据结构也有帮助-main mathematical equation is the basic framework is used for the data structure also helped

Floyd 算法，创建有向图，无向图，有向网，无向网的算法-Floyd algorithm, create a directed graph, undirected graph, directed networks, undirected networks algorithm

一套完整的人力资源管理系统，包括数据库的增删改查,数据库为SQL，封装了所有访问SQL的函数，程序可靠性高， 稍加修改便可使用，可供个人开发和学习使用  一套完整的人力资源管理系统，包括数据库的增删改查,数据库为SQL，封装了所有访问SQL的函数，程序可靠性高， 稍加修改便可使用，可供个人开发和学习使用