-
using Windows API, including how to control the menu display and hidden menu ite...
使用windowsapi,包括如何控制菜单的显示和隐藏菜单项
- 2022-09-10 09:40:02下载
- 积分:1
-
小区物业管理系统
小区物业管理系统-Building Management System
- 2022-11-20 23:55:03下载
- 积分:1
-
插值类 CInterpolate
一元全区间不等距插值 一元全区间等距插值 一元三点不等距插值 连分式不等距插值 埃尔米特不等距插值 光滑不等距插值 二元...
插值类 CInterpolate
一元全区间不等距插值 一元全区间等距插值 一元三点不等距插值 连分式不等距插值 埃尔米特不等距插值 光滑不等距插值 二元全区间插值-interpolation category CInterpolate one yuan is not equidistant between the region interpolation one yuan region equidistant between 3:00 interpolation one yuan is not even fractional offset interpolation is not equidistant interpolation Hermite"s not equidistant interpolation smooth interpolation is not equidistant between two yuan region Interpolation
- 2023-05-18 16:20:04下载
- 积分:1
-
ASP直接存取ACCESS数据库
ASP直接存取ACCESS数据库-ASP direct access ACCESS database
- 2022-11-25 16:25:04下载
- 积分:1
-
一 开发环境
OS: Windows 2000 Server + SP2
IDE: Visual Studio 6.0 + SP5
DataBase...
一 开发环境
OS: Windows 2000 Server + SP2
IDE: Visual Studio 6.0 + SP5
DataBase: SQL 2000 Server + SP2
二 运行
1:创建数据库
将TRADE.sql中的SQL语句考入SQL Server的查询分析器中,全部运行;
2:建立ODBC数据源
数据原名称为Trade_MIS-A development environment OS: Windows 2000 Server+ SP2 IDE: Visual Studio 6.0+ SP5 DataBase: SQL 2000 Server+ SP2 Second run 1: create a database of SQL statements TRADE.sql admitted to the SQL Server" s Query Analyzer, all running 2: Create ODBC data source data formerly known as Trade_MIS
- 2023-02-23 05:45:05下载
- 积分:1
-
矩阵运算
Matrix operations
solution of AX=B
Jordan and newton Methods
- 2022-03-03 02:05:43下载
- 积分:1
-
(1)输入E条弧<j,k>,建立AOE
(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
- 2022-03-20 01:39:05下载
- 积分:1
-
压缩包内解决用计算机实现图论中的最短路问题
压缩包内解决用计算机实现图论中的最短路问题-Compression package to resolve the computer graph theory realize the shortest path problem
- 2022-03-23 13:39:37下载
- 积分:1
-
小的 VB6 程序,接收来自 YHT3 称的重量。
VB6 的小程序,接收来自 YHT3 规模的重量,保存日期来访问数据库。
- 2023-01-17 18:00:04下载
- 积分:1
-
使用vc进行数据库编程的好例子,很有参考价值
使用vc进行数据库编程的好例子,很有参考价值-use database programming vc good example of great reference value
- 2022-03-10 15:25:21下载
- 积分:1