Location:
Search - AOE
Search list
Description: AOE图工程工期控制问题，求解工程的工期与关键路径-AOE plans to control the construction period, the time limit for the project and the critical path
Platform: |
Size: 2243 |
Author: aaa |
Hits:
Description: 里面有一自已设计的AOE和Kruska的算法,已通过运行,大家可以看看.-inside an AOE own design algorithms and Kruska, by running, we will look at.
Platform: |
Size: 122026 |
Author: 徐飞 |
Hits:
Description: 二叉树上结点的路径,航班信息的查询与检索,赫夫曼编码的应用,AOE网,大整数计算5个数据结构里比较实际的编程例子,自己写的
Platform: |
Size: 9422 |
Author: 李日 |
Hits:
Description: 自己设计一个项目，排出AOE网络，并将数据输入计算机，用程序进行分析。
Platform: |
Size: 1791 |
Author: liangliu |
Hits:
Description: WinAoE is an open source GPLv3 driver for using AoE (ATA over Ethernet) on Microsoft Windows
Platform: |
Size: 171022 |
Author: tony |
Hits:
Description: Virtual EtherDrive® blade AoE target.
Platform: |
Size: 20429 |
Author: tony |
Hits:
Description: 运行程序后！由于为了测试方便，AOE网初始化，所以，运行程序后，即可得到结果，结果包括拓扑排序和关键路径。-operating procedures! In order to facilitate the testing because, AOE network initialization, and operating procedures, can be obtained results include topological sorting and Critical Path.
Platform: |
Size: 31466 |
Author: 骆子丞 |
Hits:
Description: 数据结构算法，aoe ，图的最小代价路径检索。-data structure algorithms, aoe, for the minimal cost path retrieval.
Platform: |
Size: 38623 |
Author: 王回 |
Hits:
Description: (1)输入E条弧<j,k>,建立AOE-网的存储结构 (2)从源点v出发,令ve[0]=0,按拓扑排序求其余各项顶点的最早发生时间ve[i](1<=i<=n-1).如果得到的拓朴有序序列中顶点个数小于网中顶点数n,则说明网中存在环,不能求关键路径,算法终止 否则执行步骤(3)(3)从汇点v出发,令vl[n-1]=ve[n-1],按逆拓朴排序求其余各顶点的最迟发生时间vl[i](n-2>=i>=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 of l (s). If any meet the conditions of the arc e (s) = l (s), was critical activities.
Platform: |
Size: 1972 |
Author: 叶兆源 |
Hits:
Description: 无向图的邻接表的建立和遍历-no plans to the table adjacent to the establishment and ergodic
Platform: |
Size: 1024 |
Author: 文策 |
Hits:
Description: 国外优秀游戏源码系列之一,玩过帝国时代吗？这款游戏就是类帝国时代的游戏,可是外国牛人所作哦，参考价值嘛，没的说了!!! :)-outstanding foreign source one of the series of the game, played Age of Empires? This game is like Age of Empires game, but were made by foreign cattle Oh, reference value, right to say no! ! ! :)
Platform: |
Size: 3392512 |
Author: |
Hits:
Description: 从文件input中读入一个事件结点网络，
并求出各活动的可能的最早开始时间和允许的最晚完成时间、
整个工程的最短完成时间、哪些活动是关键活动、
提高哪些活动的速度能够使整个工程提前完成等等，
并将求出的结果写入到output文件中。
-input write to the output document.
Platform: |
Size: 3072 |
Author: 汪江 |
Hits:
Description: 二叉树上结点的路径,航班信息的查询与检索,赫夫曼编码的应用,AOE网,大整数计算5个数据结构里比较实际的编程例子,自己写的-Binary tree node on the path, flight information query and retrieval, the application of Huffman coding, AOE network, large integer calculation 5 data structure more practical programming examples written in their own
Platform: |
Size: 9216 |
Author: 李日 |
Hits:
Description: 自己设计一个项目，排出AOE网络，并将数据输入计算机，用程序进行分析。-A project of their own design, from AOE network, and data entered into the computer, using the procedure for analysis.
Platform: |
Size: 2048 |
Author: liangliu |
Hits:
Description: 游戏图片解码工具。
可以将帝国时代1和帝国时代2中的图形资源提取出来
-Game picture decoding tool. Can be Age of Empires Age of Empires 1 and 2 graphics resources extracted
Platform: |
Size: 265216 |
Author: softkingdom |
Hits:
Description: Virtual EtherDrive® blade AoE target.
Platform: |
Size: 20480 |
Author: tony |
Hits:
Description: This an implementation of double-array structure for representing trie,
as proposed by Junichi Aoe [1].
Trie is a kind of digital search tree, an efficient indexing method with
O(1) time complexity for searching. Comparably as efficient as hashing,
trie also provides flexibility on incremental matching and key spelling
manipulation. This makes it ideal for lexical analyzers, as well as spelling
dictionaries.
See the details of the implementation at [2]:
http://linux.thai.net/~thep/datrie/datrie.html
Historically, this was first implemented as C++ classes in a library called
midatrie [2], but later simplified and rewritten from scratch in C.-This is an implementation of double-array structure for representing trie,
as proposed by Junichi Aoe [1].
Trie is a kind of digital search tree, an efficient indexing method with
O(1) time complexity for searching. Comparably as efficient as hashing,
trie also provides flexibility on incremental matching and key spelling
manipulation. This makes it ideal for lexical analyzers, as well as spelling
dictionaries.
See the details of the implementation at [2]:
http://linux.thai.net/~thep/datrie/datrie.html
Historically, this was first implemented as C++ classes in a library called
midatrie [2], but later simplified and rewritten from scratch in C.
Platform: |
Size: 34816 |
Author: lucoy |
Hits:
Description: 解决工程项目aoe-网的关键路径的问题，用到了拓扑排列 求最早发生时间 活动的最迟完成时间-Solution aoe-Net project critical path of the problem, use a topological order for the first time the activities took place at the latest completion time
Platform: |
Size: 7168 |
Author: 何高兴 |
Hits:
Description: 2、设计一个程序求出完成整项工程至少需要多少时间以及整项工程中的关键活动。
实验步骤：
①、在Java语言编辑环境中新建程序，输入如下图所示的AOE网；
②、按照关键路径求取步骤，求出各个顶点的最早开始时间和最迟开始时间；
③、求出各个活动的最早开始时间和最迟开始时间；
④、找出该AOE网的关键路径，并计算出该项目的完成时间。-How much time, and the whole project is a key activity in the design of a program determined to complete the entire project would need at least.
Platform: |
Size: 6144 |
Author: 甘颖乐 |
Hits:
Description: 用邻接表存储有向图并建立AOE网；
用图形的形式输出有向图；
输出关键路径和关键活动。-Adjacency table is stored AOE directed graph and the establishment of networks
In the form of graphics output directed graph
Output critical path and critical activities.
Platform: |
Size: 2048 |
Author: hjm |
Hits: