实现了关键路径算法。 给定一些点，并给定点间的路径的权值，求两点间的最短路径...

Data Structure of maps

算法分析，此教程介绍一些常用的算法，比如回溯法，-failed to translate

改进的矩阵操作类,增加了诸如对矩阵任意行/列的存取,矩阵的积分图像的计算等-improved matrix operations, such as the right to increase the matrix arbitrary line/column access, image matrix of the integral calculation

实现哈希表的建立,插入等功能,并用初留余数法构造,处理冲突-Realize hash wish foundation of form , function of meddling in etc. , and with leave remainder law construct for the first time, deal with the conflict

《数据库系统实现》前四章，数据库实现的经典书，介绍了很多原理性的东西。-" Database system implementation," the first four chapters, the database to achieve a classic book describes the principles of a lot of things.

数据结构的查询方式及其应用，是其中的比较重要的一种-Query data structure and its applications, is one of the more important a

图的相关学习,对建立图,图的一系列基本函数的操作,有详细的注释!

Computes estimates for the number of forests of a graph, input as a 0-1 incidence matrix. Notes: Compile in C++, "g++ -o span_forest span_forest.c". The program does not demand that the matrix is symmetric with 0 diagonal, but uses only the upper triangular part. -Computes estimates for the number of fores ts of a graph. input as a 0-1 incidence matrix. Notes : Compile in C, "g-o span_forest span_forest.c." The program does not demand that the matrix is symmetric wit h 0 diagonal. but uses only the upper triangular part.

Delphi 写的 DataSet 导出为Excel 类，不用第三方控件，从CReoprt中切出来，又加工的。

derby database source code.good for you.