-
Kruskal算法寻找最小生成树,C语言实现,有完整的注释!
Kruskal算法寻找最小生成树,C语言实现,有完整的注释!-Kruskal finding minimum spanning tree algorithm, C Language, a complete Notes!
- 2022-07-23 02:10:48下载
- 积分:1
-
以邻接矩阵作为图的存储结构,根据键盘输入创建图,并深度优先、广度优先遍历该图...
以邻接矩阵作为图的存储结构,根据键盘输入创建图,并深度优先、广度优先遍历该图-matrix as to the adjacent storage structure of the plan, according to the keyboard input to create map and depth of priority, breadth priority traversal of the plan
- 2022-11-07 21:25:03下载
- 积分:1
-
本科时参加小竞赛设计的一个代数运算器
1. 能对常用的四则运算,三角, 乘方,开方运行2. 支持变量赋值和运算 3. 增加批处理执行功能(批处理脚本文件)...
本科时参加小竞赛设计的一个代数运算器
1. 能对常用的四则运算,三角, 乘方,开方运行2. 支持变量赋值和运算 3. 增加批处理执行功能(批处理脚本文件)
4. 增加对向量或矩阵运算的支持,如输入
-Undergraduate to participate in the design a little contest an algebraic calculator. Can commonly used four arithmetic, trigonometry, involution, prescribing run 2. Supports variable assignments and operations 3. Increase the batch executive function (a batch script file) 4. increase support for vector or matrix operations, such as the input
- 2022-07-17 11:32:14下载
- 积分:1
-
图的应用,二叉树的应用与操作为题目的数据结构课程设计。有详细的文字说明和源代码。...
图的应用,二叉树的应用与操作为题目的数据结构课程设计。有详细的文字说明和源代码。-Map applications, application and operation of a binary tree data structure for the subject curriculum design. A detailed written instructions and source code.
- 2023-05-24 18:30:03下载
- 积分:1
-
站长以前写的informix通用开发包源码,用c和ec编写
站长以前写的informix通用开发包源码,用c和ec编写-common code for infomrix,c and ec
- 2022-03-17 12:18:44下载
- 积分:1
-
以前做的课程设计,可用于学习VB与ACCESS的连接!
以前做的课程设计,可用于学习VB与ACCESS的连接!-done before the curriculum design, learning VB can be used in connection with ACCESS!
- 2022-02-15 13:33:11下载
- 积分:1
-
我做的一个图书馆数据库系统,有3,4个表。适合参考
我做的一个图书馆数据库系统,有3,4个表。适合参考-I make a library database system, there are tables 3,4. Suitable reference
- 2022-04-02 00:49:57下载
- 积分:1
-
用vfp实现的工资管理系统源码,可实现中小企业员工工资自动化管理。...
用vfp实现的工资管理系统源码,可实现中小企业员工工资自动化管理。-Implemented using vfp salary management system source code, can realize automatic management of small and medium enterprises, wages and salaries.
- 2022-06-21 15:22:00下载
- 积分:1
-
Pre
前k条最短路径(KSP)算法在国内鲜有研究,本压缩包中文献整合了自1971年此问题被提出后几十年来的论文共25篇。
其中以Martin先生的删除(Delelte)算法与Yen先生的背离(Devation)算法为主。
其中所有文献均来自网络。含有两篇中文文章以及23篇英文文章。
算法的复杂度基本控制于O(logn)内-Pre-k shortest paths (KSP) algorithm in the domestic few studies in the literature in this compressed package integration since 1971, this issue has been moved for several decades a total of 25 papers. Among them, Mr. Martin removed (Delelte) algorithm and Mr. Yen departure (Devation) algorithm is based. In which all documents are from the network. Contains two Chinese articles and 23 articles in English. The complexity of basic control algorithms in O (logn) in
- 2023-01-02 04:10:18下载
- 积分: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