Welcome！[Sign In] ！[Sign Up]！
Front-page it | Collect it | [中国-简体中文]
FAQ Fav
Location:
Search - AOE

Search list

[Other] AOE

Description: 采用数据结构中的AOE方法对图的关键路径进行计算，此算法摘录了课本中的算法-using the data structure to map AOE method of calculation of critical path, this algorithm extracts from the books of Algorithm
Platform: | Size: 1957 | Author: 吴晓辉 | Hits:

[Other resource] AOE

Description: 该算法用于分析AOE网络,求出AOE网络的关键路径.-The algorithm used to analyze the AOE network, the network obtained AOE Critical Path.
Platform: | Size: 1479 | Author: Ash | Hits:

[Other resource] AOE

Description: 设计一个项目，排出AOE网络，并将数据输入计算机，用程序进行分析。
Platform: | Size: 1254 | Author: 杨襄 | Hits:

[Other] aoe

Description: aoe 算法实现以及具体程序框架，很好的实现了aoe程序
Platform: | Size: 2382 | Author: ws | Hits:

[Other resource] AOE网

Description: AOE网算法，VC实现-AOE network algorithm, VC
Platform: | Size: 87380 | Author: 沈凌 | Hits:

[Other resource] AOE-net

Description: 该程序能实现的功能，若活动图有回路则无法计算出关键路径，即解决了判断工程的可行性问题。通过对工程活动的输入，可以建立任意的AOE网进行判断。对于输入的网，可以计算出每个活动的最早开始时间，最迟开始时间和全工程可以完成的最早时间，并找出关键路径和关键活动。-the program can achieve the functional, if a circuit map activities can not be calculated critical path, that is a judgment to resolve the feasibility of the project. Right through the importation of construction activities, we can establish arbitrary judgment AOE network. The network for the importation can be calculated for each of the earliest start time, the latest starting time and the entire project will be completed in the first time, and identify key and critical path activities.
Platform: | Size: 1722 | Author: 邱孝杰 | Hits:

[AI-NN-PR] source

Description: 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 coordinates), computer graphics hatched filling algorithm (mouse input), Artificial Intelligence A* algorithm The C Programming Language
Platform: | Size: 11264 | Author: 站长 | Hits:

[Other] 关键路径算法

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: 30720 | Author: 骆子丞 | Hits:

[Algorithm] AOE网

Description: AOE网算法，VC实现-AOE network algorithm, VC
Platform: | Size: 3528704 | Author: 沈凌 | Hits:

[Data structs] aoe网络

Description: 我自己写的AOE网络算法-I wrote it myself AOE Network Algorithm
Platform: | Size: 2048 | Author: 王坚 | Hits:

[Data structs] 4th_AOE

Description: 数据结构算法，aoe ，图的最小代价路径检索。-data structure algorithms, aoe, for the minimal cost path retrieval.
Platform: | Size: 37888 | Author: 王回 | Hits:

[Data structs] 关键路径

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: 2048 | Author: 叶兆源 | Hits:

[Data structs] AOE-net

Description: 该程序能实现的功能，若活动图有回路则无法计算出关键路径，即解决了判断工程的可行性问题。通过对工程活动的输入，可以建立任意的AOE网进行判断。对于输入的网，可以计算出每个活动的最早开始时间，最迟开始时间和全工程可以完成的最早时间，并找出关键路径和关键活动。-the program can achieve the functional, if a circuit map activities can not be calculated critical path, that is a judgment to resolve the feasibility of the project. Right through the importation of construction activities, we can establish arbitrary judgment AOE network. The network for the importation can be calculated for each of the earliest start time, the latest starting time and the entire project will be completed in the first time, and identify key and critical path activities.
Platform: | Size: 1024 | Author: 邱孝杰 | Hits:

[Other] AOE

Description: 采用数据结构中的AOE方法对图的关键路径进行计算，此算法摘录了课本中的算法-using the data structure to map AOE method of calculation of critical path, this algorithm extracts from the books of Algorithm
Platform: | Size: 2048 | Author: 吴晓辉 | Hits:

[Data structs] AOE

Description: 该算法用于分析AOE网络,求出AOE网络的关键路径.-The algorithm used to analyze the AOE network, the network obtained AOE Critical Path.
Platform: | Size: 1024 | Author: Ash | Hits:

[Data structs] key_path

Description: AOE图工程工期控制问题，求解工程的工期与关键路径-AOE plans to control the construction period, the time limit for the project and the critical path
Platform: | Size: 2048 | Author: aaa | Hits:

[Software Engineering] AOEKruska

Description: 里面有一自已设计的AOE和Kruska的算法,已通过运行,大家可以看看.-inside an AOE own design algorithms and Kruska, by running, we will look at.
Platform: | Size: 121856 | Author: 徐飞 | Hits:

[Data structs] AOE

Description: 设计一个项目，排出AOE网络，并将数据输入计算机，用程序进行分析。-Design a project, from AOE network, and data entered into the computer, using the procedure for analysis.
Platform: | Size: 1024 | Author: 杨襄 | Hits:

[Algorithm] Aoe

Description: 尋找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
Platform: | Size: 1024 | Author: kai | Hits:

[JSP/Java] AOE

Description: java 语言实现AOE网与关键路径的查找-java language AOE network and find the critical path
Platform: | Size: 20480 | Author: nishiting | Hits:
« 12 3 4 5 6 »

CodeBus www.codebus.net