商品交易管理数据库

一个很好的矩阵类，使用者用了请务必感谢原作者-a good matrix type, users spent Be sure to thank the original author! !

二叉树的基本操作-binary tree as the basic operation

我已经寄给这个网站的数据库管理系统项目。这是对每个数据库管理员非常有用谁对此工作。这一项目被实施使用 java 服务器 page(JSP)

凸包算法的实现，用的控制台程序，不过已经能够说明问题了-convex hull algorithm for the realization of the console procedures, but has been able to illustrate the problem

最小生成树，我自己做的小程序，很好用，希望和大家分享-Minimum spanning tree, my own little program, very good, and would like to share with

C#代码创建Access MDB数据库,无需Access环境.-C# Code to create Access MDB database without Access environment.

教务辅助管理系统利用VB开发的数据库管理系统,里面分学生,教师,教务等等各方面的需求满足学校的教务管理的简单需求!-Senate Assistant Management System Using VB development of the database management system, which, students, teachers, Senate, the areas of the school to meet the needs of the academic management of the simple demand!

(1)输入E条弧,建立AOE-网的存储结构 (2)从源点v出发,令ve[0]=0,按拓扑排序求其余各项顶点的最早发生时间ve[i](1=2). (4)根据各顶点的ve和vl值,求每条弧s的最早发生时间e(s)和最迟开始时间l(s).若某条弧满足条件e(s)=l(s),则为关键活动.-(1) E importation of Arc lt; J, kgt; Establish AOE- network storage structure (2) v starting point source, ve [0] = 0, by topological sorting point for the rest of the earliest timing ve [i] (1LT ; = ilt; = n-1). if the Topography vertex orderly sequence number is less than net n vertices, a statement that net presence in Central, not for Critical Path, algorithm implementation steps to terminate or (3) (3) from the Department of v starting point, Vl [n-1] = ve [n-1], by the inverse order for the remaining topology of the latest occurrence of peak time Vl [i] (n-inversion; = IGT; = 2). (4) According to the apex of ve and Vl value for each s arc of the earliest timing e (s) and the latest starting time

是一个表达式求值的算法，用 模板实现的，可以进行四则运算，支持小数和括号-is an expression evaluates the algorithm, using the template, can be four operators, and parentheses minority support

数据结构的java实现-data structure to achieve the java