为保障煤矿为例

一个详实的图书信息管理系统，包括入库、出库，查询等功能模块，和一个简单的系统帮助文件。-A detailed book information management system, including storage, a library, query, such as function modules, and a simple system to help document.

在有向图中计算最小生成树---Edmonds s Algorithm-Directed graph in calculating minimum spanning tree--- Edmonds s Algorithm

数据结构大作业的非界面版-large data structure of the non-operational interface version

数据库管理的例子-database management examples

网络流算法的程序以及用网络流解决两个最小割模型的代码-Network flow algorithm for the procedure as well as network flow solution to the two minimal cut model code

VFP图书馆管理系统-VFP Library Management System

这个项目是由帐户管理系统组成。雇员的数据给数据库。usernme 和密码用于开放系统。

广义表的反序 逆置广义表的递归模型如下： F(LS) = null 　　　　　　　　　　　　　若 LS 为空 F(LS) = LS 　　　　　　　　　　　　　若 LS 为原子，且 tail(LS) 为空 F(LS) = append( F(tail(LS)), head(LS) ) 　若 LS->tag=0 ，且 LS->tp!=null F(LS) = append( F(tail(LS), F(head(LS)) ) 　若 LS->tag=1 其中 append(a,b) 的功能是将广义表 a 和 b 作为元素的广义表连接起来。-Generalized table set against the broad anti-order recursive model of the table is as follows: F (LS) = null if the LS is empty F (LS) = LS if LS for the atoms, and the tail (LS) is empty F (LS) = append (F (tail (LS)), head (LS)) if the LS-> tag = 0, and the LS-> tp! = null F (LS) = append (F (tail (LS), F (head (LS))) If the LS-> tag = 1 where append (a, b) function is a generalized form, and b as elements of generalized tables connected.

非常实用的NET的SQL 程序-A very useful NET s SQL progam.

实现md5文件电子签名，md5hash值计算，比较文件，自己可扩展功能实现几个文件对比，从而找出重复文件-Md5 files to achieve electronic signature, md5hash calculated to compare documents, they can extend the functionality to achieve a number of document comparison, and to find duplicate files