-
(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
-
calculated factorial majority, in a calculated within seconds above 10,000 integ...
计算大数阶乘，可以在1秒内计算出10000以上的整数阶乘-calculated factorial majority, in a calculated within seconds above 10,000 integer factorial
- 2022-08-12 20:59:11下载
- 积分：1
-
loginpageusing c#.net
在visual studio 2010中使用c#.net登录页面，使用microsoft sql server 2008连接，连接字符串位于应用程序代码中，sql server数据位于live链接中。该代码已被用于用户登录使用多个设置，如管理员用户，最终用户等。，
- 2022-11-20 11:55:04下载
- 积分：1
-
设计一个实用的小型商店销售管理系统 二.功能： 1. 登记收入支出 2. 统计每日或每周的销售情况，按规定格式打印销售报表 3. 允许多种方式查询货物情况 4....
设计一个实用的小型商店销售管理系统 二.功能： 1. 登记收入支出 2. 统计每日或每周的销售情况，按规定格式打印销售报表 3. 允许多种方式查询货物情况 4. 按货物销售情况提前发出预报-practical design a small shop sales management system 2. Functions : 1. Revenue expenditure registered two. Statistics daily or weekly sales, as required format Print sales statements 3. For a variety of ways to allow cargo 4. Sales of goods by the early forecast issued
- 2022-03-30 23:44:06下载
- 积分：1
-
直接存取Access97数据库文件(MDB)的工具库源码
直接存取Access97数据库文件(MDB)的工具库源码- Direct access Access97 database file (MDB) tool room source
code
- 2023-08-02 01:40:04下载
- 积分：1
-
[问题描述]
将N个关键字去整数的记录进行整序， 以使所有关键字为非负数的记录排在关键字为负数的记录之前，要求使用最少的附加空间，且算法的时间复杂度为O（N...
[问题描述]
将N个关键字去整数的记录进行整序， 以使所有关键字为非负数的记录排在关键字为负数的记录之前，要求使用最少的附加空间，且算法的时间复杂度为O（N）
[输入]
待排序记录个数，各关键字的值。
[输出]
关键字从正负分开，正数在前
[存储结构]
待排序记录顺序存储。
[算法的基本思想]
快速排序算法每次任取一个记录的关键字为标准，将其余记录分为两组将，N个关键字去整数的记录进行整序， 以使所有关键字为非负数的记录排在关键字为负数的记录之前。
#include
using namespace std
#define MAXNUM 100//设文件的最长可能长度
void sort(int* keys, const int len)//排序
-[Problem Description] N keyword to the integer sequence the entire record. keyword so that all non-negative Records with the keyword for the negative record, at least require the use of the additional space and time complexity of the algorithm is O (N) [imported] to be sort record number, The value of the keyword. [Output] keyword separate from the pluses and minuses are several former [storage structure] scheduling records to be stored sequence. [Algorithm for the basic idea] quick sort algorithm each time a record for any keyword as a standard, The remaining records will be divided into two groups, N-keyword
- 2022-03-17 21:15:57下载
- 积分：1
-
二叉树有一个优雅的递归指针结构，所以他们是一个很好的学习方法递归指针算法。...
二叉树有一个优雅的递归指针结构，所以他们是一个很好的学习方法递归指针算法。
- Binary trees have an elegant recursive pointer structure, so they are a good way to learn recursive pointer algorithms.
- 2023-08-18 16:15:03下载
- 积分：1
-
ioop rtyoirtopyrt optyi`
fsdfsadfsdfsdfsdgdgdgfg dsfg sdfg dsf gsdfg sdfgsdfg gddflskgksd gdfsjklgjklsd kldfg jsdfj klgsfsgfsgjkl；sg dfg osdpg posdfig ；goipdf gdfpogsdf opsdf gspdo sdfpo gisdf gpsdfog ipsdfg sdfop gisdfpogg ；fsadfsdfsddfgdgfg dfgfgfg sdfg dsdfg gsdfg gsdfg sdfgsdfg gdfgsdfg gdgfgsdfg gdfsjkldfg jsdfj klgsfsgfsgjkl；sg dfg osdpg posggoipdf gdfpogsdf opsdf gspdo sdfpo gisdf gpsdfog ipsdfg sdfop gisdfpog fsdfsadfsdgfg dfgdgfg dsfg sdfg dsf gsdfg sdfgsdfg sdfgsdfg gfd g gjdflskgksd gdfsjklgsd kldfg jsdfj klgsfsgfsgjkl；sg dfg osdpg posdfig goipf gdfog opsdf gspdo sdfpo gisdf gpsdfog ipsdfpog；fsdfsadfsdfsdfsdgdgdgfg dsfg sdfg dsf gsdfg sdfgsdfg gddflskgksd gdfsjklgjklsd kldfg jsdfj klgsfsgfsgjkl；sg dfg osdpg posdfig ；goipdf gdfpogsdf opsdf gspdo sdfpo gisdf gpsdfog ipsdfop gisdfpog ；
- 2022-07-20 07:02:24下载
- 积分：1
-
本程序集合了数据结构8种主要的排序方法：插入排序、冒泡排序、选择排序、快速排序、希尔排序、堆排序、归并排序、基数排序。...
本程序集合了数据结构8种主要的排序方法：插入排序、冒泡排序、选择排序、快速排序、希尔排序、堆排序、归并排序、基数排序。-the procedures set of data structure of the eight major sequencing method : Insert ranking Bubble Sort, select, in order of Quick Sort, Hill sequencing, heap sort, merge, in order of ranking base.
- 2022-06-01 02:33:00下载
- 积分：1
-
数据结构的电子教案，对各章的重点说的比较清楚
数据结构的电子教案，对各章的重点说的比较清楚-Data structure of electronic lesson plans, the focus of the chapter, said the relatively clear
- 2022-01-31 18:14:27下载
- 积分：1
