搜索资源列表
AOE
- 该算法用于分析AOE网络,求出AOE网络的关键路径.-The algorithm used to analyze the AOE network, the network obtained AOE Critical Path.
key_path
- AOE图工程工期控制问题，求解工程的工期与关键路径-AOE plans to control the construction period, the time limit for the project and the critical path
AOE
- 设计一个项目，排出AOE网络，并将数据输入计算机，用程序进行分析。
AOE网
- AOE网算法，VC实现-AOE network algorithm, VC
4th_AOE
- 数据结构算法，aoe ，图的最小代价路径检索。-data structure algorithms, aoe, for the minimal cost path retrieval.
关键路径
- (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(
AOE-net
- 该程序能实现的功能，若活动图有回路则无法计算出关键路径，即解决了判断工程的可行性问题。通过对工程活动的输入，可以建立任意的AOE网进行判断。对于输入的网，可以计算出每个活动的最早开始时间，最迟开始时间和全工程可以完成的最早时间，并找出关键路径和关键活动。-the program can achieve the functional, if a circuit map activities can not be calculated critical path, that is a judgmen
source
- C词法分析器实现,AOE网络算法实现,KRUSKAL算法实现,PRIM算法实现,计算机图形学影线填充算法（键盘坐标输入）,计算机图形学影线填充算法（鼠标输入）,人工智能A*算法实现的C语言程序-C lexical analyzer to achieve, AOE network algorithm, KRUSKAL algorithm, PRIM algorithm, computer graphics hatched filling algorithm (keyboard input coor
aoe网络
- 我自己写的AOE网络算法-I wrote it myself AOE Network Algorithm
datrie_cvs20061001.tar
- 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 h
guanjianlujin
- 解决工程项目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
aoe
- AOE网关键路径（Activity On Edge） 数据结构其中前两个数代表两个顶点之间的通路，后两个数分别代表最早开始时间和最迟开始时间 带有*的通路组成关键路径； -Key path AOE Gateway (Activity On Edge) the first two of which data structure to represent the path between two vertices, the number of the latter two represent t
AOE
- 自己写的数据结构的AOE网络的算法，大二的时候写的，写的不好请不要见怪-Write their own data structure of the AOE network algorithm, written in his sophomore year when, well written please forgive
CriticalPath
- 用顶点表示事件，弧表示活动，弧上的权值表示活动持续的时间的有向图叫AOE 。AOE网常用于估算工程完成时间。可通过本算法来计算关键路径-Activity On Edge Network
path01
- C++ 寻找关键路径 根据AOE网络寻找关键活动，确定关键路径 最好的解决方式-C++ find the critical path
Aoe
- 尋找AOE的陣列只要輸入你想要的連接方式 透過AOE可以幫你找出所要的陣列轉換-Find AOE array as long as the connection method you want to enter through the AOE can help you find the array to be converted
MFC_Critical_Path
- 关键路径，数据结构的ＡＯＥ问题的图形界面表示，ＭＦＣ经典例题-Critical path, data structure, said graphical interface AOE issues, MFC classic example
libdatrie-0.2.4.tar
- 这是一个经典的通过双数组实现Trie树的示例-This is an implementation of double-array structure for representing trie, as proposed by Junichi Aoe
the-key-to-find-the-network-path-AOE
- 本程序代码是用c语言来实现求AOE网络中的关键路径-This code is in c language to realize the key to find the network path AOE
AOE
- AOE关键路径，数据结构课程设计，使用MFC界面，图形化操作。有实验报告。-AOE critical path program. my project for Data Structure. Using MFC UI, Operate in GUI. It contain a report.