-
first simple MCF exercise
first simple MCF exercise
- 2022-11-10 03:55:04下载
- 积分：1
-
一步 学VB2005数据库编程,WROX出品,Roger Jennings编写,啥也不多说了,学VB.NET必看的精品
一步 学VB2005数据库编程,WROX出品,Roger Jennings编写,啥也不多说了,学VB.NET必看的精品-Database Programming VB2005 step Xue, WROX produced, Roger Jennings writing, what not to say, the school must-see boutique VB.NET
- 2022-04-22 01:39:38下载
- 积分：1
-
Shortest Path Problem Description C
最短路径问题C++描述-Shortest Path Problem Description C
- 2022-01-27 14:10:42下载
- 积分：1
-
used to write the right matrix inversion algorithm, the introduction of direct i...
用c写的对矩阵求逆的算法，采用直接迭代，适合2阶和3阶矩阵-used to write the right matrix inversion algorithm, the introduction of direct iteration, for two bands and three bands Matrix
- 2022-02-05 09:38:44下载
- 积分：1
-
二叉排序树，包括插入节点、删除节点、中序线索化、中序遍历等功能...
二叉排序树，包括插入节点、删除节点、中序线索化、中序遍历等功能-Binary sort tree, including the insert node, delete node, in the sequence of clues, in the traversal functions
- 2022-07-18 03:50:01下载
- 积分：1
-
下面是本人做的一个关于菜单的程序,其中对菜单的各种改变采用了重画技术.....
下面是本人做的一个关于菜单的程序,其中对菜单的各种改变采用了重画技术..
-Below is the one I do on the menu of procedures, which on the menu to change the re-drawing of the technology ..
- 2022-02-15 18:11:31下载
- 积分：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
-
10名海盗抢得了窖藏的100块金子，并打算瓜分
这些战利品。这是一些讲民主的海盗（当然是他们自己特有的民主），他们的习惯
是按下面的方式进行分配：最...
10名海盗抢得了窖藏的100块金子，并打算瓜分
这些战利品。这是一些讲民主的海盗（当然是他们自己特有的民主），他们的习惯
是按下面的方式进行分配：最厉害的一名海盗提出分配方案，然后所有的海盗（包
括提出方案者本人）就此方案进行表决。如果50%或更多的海盗赞同此方案，此方
案就获得通过并据此分配战利品。否则提出方案的海盗将被扔到海里，然后下提名
最厉害的海盗又重复上述过程-10 pirates seize a cache of 100 gold, and plan to divide up these spoils of war. This is the democracy of some pirates (of course it was their own unique democracy), their habits are based on the following manner allocation : one of the most powerful pirate proposed distribution plan, and then all the pirates (including the proposal himself) on this program for a vote. If 50% or more of the pirates agreed to this program, this program was adopted and on the allocation of spoils of war. Otherwise, the proposals will be pirates thrown into the sea, and then nominate the most serious piracy repeated this process
- 2023-06-24 15:35:03下载
- 积分：1
-
unix上的ODBC实现
unix上的ODBC实现-unix on ODBC to achieve
- 2022-01-27 13:30:47下载
- 积分：1
-
数据结构算法演示
数据结构算法演示-demonstration algorithm data structure
- 2022-04-22 15:03:26下载
- 积分：1
|
联系客服（QQ：3324461878）
