关于图遍历的演示包括所有的源代码和执行文件，内容齐全，数据结构的有关作业-Ergodic on the map presentation, including all source code and implementation of document, content complete, the data structure of the operating

VC++ 中使用 DB-Libray 编程(SQL Server) -use DB-Libray programming (SQL Server)

最小二乘法曲线拟合的经典算法，做过特征数检验，只需调用fit，文件中其他函数被fit调用，其中个输入输出变量均以给出详细说明。-least squares curve fitting classic algorithms, the number of tests done, just call fit, the paper other function to be fit Call, 000 input and output variables were presented in detail.

本程序是一个校园导游咨询系统，提供校园内各景点的信息咨询和最点路径查询功能。-This procedure is a consultation system for the campus tour guides, provide campus information tourist attractions and the most points the path of the inquiry.

用vb写的饮食管理系统功能全面-with vb was eating a comprehensive management system function

此项目帮助您管理您的数据与交易基地使用 ConnectionString、 OleDb 或 Odbc 连接。

一个SQL数据库的小例子-a example of sql database

表达式求值算法

一个简单的订单管理系统,用MS SQL,呵呵,下下吧-a simple Order Management System, MS SQL, Oh, where are you

(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