Astar 精灵版本

一个关于公式分析得java小程序，内含全部源代码和接口的详细使用说明，对于学习数据结构的朋友来说，有一定的研究价值。-on a formula of good things java small program that contains all the source code and interface use the detailed, data for studying the structure of a friend, a certain value for research.

最小生成树问题 若要在n个城市之间建设通信网络，只需要架设n-1条线路即可。如何以最低的经济代价建设这个通信网，是一个网的最小生成树问题。 （1）利用克鲁斯卡尔算法求网的最小生成树。 （2）实现教科书6.5节中定义的抽象树类型 MFSet。以此表示构造生成树过程中的连通分量。 （3）以文本形式输出生成树中各条边以及他们的权值。 -minimum spanning tree problem to the n-city building communications networks needed to put up only n-1 lines can be. How the lowest economic cost of building the communications network, the network is a minimum spanning tree problem. (1) using Kelushikaer network algorithm for the minimum spanning tree. (2) to achieve 6.5 textbook definition of the abstract tree types MFSet. Spanning Tree Construction said this process of connectivity components. (3) the form of text output spanning trees and the edge of their weights.

专家库管理系统(多用户)-expert database management system (multi-user)

Las Vegas，KMP，Mentro carlo这三种模式匹配算法的原代码，对其进行了时间及出错率的比较-Las Vegas, KMP, Mentro carlo three pattern matching algorithm of the original code, its time and the error rate comparison

this is a tunning algorithem

我的项目处理证书的校友信息系统，可以 upadate 删除和插入新数据，有时要搜索特定目的

VC++下的不规则三角网生成算法,这是不规则三角网的生长算法,通过建立TIN类,在TIN类内实现一些方法.-VC under the TIN generation algorithm, which is triangular irregular network growth algorithm, through the establishment of TIN category, the category TIN achieve some ways.

VB编写的简单打印控件-prepared by the simple VB Control Print

BM关键字查找算法，在用于查找子字符串的算法当中，BM（Boyer-Moore）算法是目前相当有效又容易理解的一种，一般情况下，比KMP算法快3-5倍。-BM keyword search algorithm used in the sub-string search algorithm which, BM (Boyer-Moore) algorithm is quite effective and easy to understand A, under normal circumstances, more than 3-5 times the KMP algorithm quickly.

实现一个数据库的连接池，提高数据库的链接效率，同时还有利于平衡物理上的访问量。-Implement a database connection pool to improve the efficiency of the database links, while also help balance the amount of physical access.