Location:
Search - AOE network
Search list
Description: 该算法用于分析AOE网络,求出AOE网络的关键路径.-The algorithm used to analyze the AOE network, the network obtained AOE Critical Path.
Platform: |
Size: 1479 |
Author: Ash |
Hits:
Description: AOE网算法，VC实现-AOE network algorithm, VC
Platform: |
Size: 87380 |
Author: 沈凌 |
Hits:
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:
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:
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:
Description: AOE网算法，VC实现-AOE network algorithm, VC
Platform: |
Size: 3528704 |
Author: 沈凌 |
Hits:
Description: 我自己写的AOE网络算法-I wrote it myself AOE Network Algorithm
Platform: |
Size: 2048 |
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: 2048 |
Author: 叶兆源 |
Hits:
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:
Description: 该算法用于分析AOE网络,求出AOE网络的关键路径.-The algorithm used to analyze the AOE network, the network obtained AOE Critical Path.
Platform: |
Size: 1024 |
Author: Ash |
Hits:
Description: 设计一个项目，排出AOE网络，并将数据输入计算机，用程序进行分析。-Design a project, from AOE network, and data entered into the computer, using the procedure for analysis.
Platform: |
Size: 1024 |
Author: 杨襄 |
Hits:
Description: 介绍求关键路经的算法，对于给出的事件结点网络，要求求出从起点到终点的所有路径，经分析、比较后找出长读最大的路径，从而得出求关键路径的算法，并给出计算机上机实现的源程序。 -Introduced via the key for the algorithm, given the events of the node network, the requirements derived from the starting point for all the path to the end of analysis, comparison, after a long time to find the path of the greatest, so as to arrive at the critical path for the algorithm, and gives the computer realization of the source machine.
Platform: |
Size: 52224 |
Author: Xu Enliang |
Hits:
Description: 自己写的数据结构的AOE网络的算法，大二的时候写的，写的不好请不要见怪-Write their own data structure of the AOE network algorithm, written in his sophomore year when, well written please forgive
Platform: |
Size: 17408 |
Author: 叶晗 |
Hits:
Description: // 自己设计一个项目，排出AOE网络，
// 并将数据输入计算机，用程序进行分析。
-Their own design of a project, drainage AOE network
Platform: |
Size: 2048 |
Author: 刘小飞 |
Hits:
Description: java 语言实现AOE网与关键路径的查找-java language AOE network and find the critical path
Platform: |
Size: 20480 |
Author: nishiting |
Hits:
Description: 本软件围绕工程活动图AOE网的应用这一主题，用图形化的界面实现了AOE网的建立、判断工程可行性、计算工程活动开始时间、确定关键路径和关键活动等功能。
具体功能：
已知假想的工程活动图AOE网，试设计一个算法，要求：
（1） 判断工程是否可行
（2） 求出工程中每个活动的最早开始时间e(i)，最迟开始时间l(i)和全工程可以完成的最早时间
（3） 确定工程中关键路径和可使整个活动的工期缩短的关键活动
源码在文件夹“源代码清单”中。程序开发时所用的文件在文件夹“配套文件”中提供。另附说明文档。
-This software around the theme of engineering activity diagram AOE network applications, the establishment of the AOE network using a graphical interface to determine the engineering feasibility, calculation of the project activity start time, to determine the critical path and critical activities.
Specific features:
Figure AOE network known hypothetical engineering activities, try to design an algorithm requirements:
(1) to determine whether the project feasible.
(2) Find the earliest start time of each activity in the project e (i) the latest start time l (i) the projects will be completed, the earliest time
(3) to determine the key activities of the project critical path and make the whole duration of shortening
Source in a folder in the source code listing. Files in the folder "supporting documents" used in program development. Attach a separate sheet document.
Platform: |
Size: 1787904 |
Author: lsc |
Hits:
Description: 一个暑假的课程设计题目，通过在表格输入AOE网络的节点和链，最后可以求出关键路径。-A summer course design topics, through the AOE network nodes and chain input in the form, and finally can find the critical path.
Platform: |
Size: 1311744 |
Author: Tony |
Hits:
Description: 数据结构、AOE、关键路径。
求关键路径
读入ＡＯＥ网数据，建立其邻接表存储结构；
输出各关键活动的起点编号、终点编号和权；
输出最短工期；-Data structure, AOE, the critical path. Finding the Critical Path reads the AOE network data, establish its adjacency list storage structure output the shortest duration of the output of the key activities starting point number, end number and the right
Platform: |
Size: 2048 |
Author: 王大可 |
Hits:
Description: 求AOE网络关键路径的源代码
输入时只能用数字 功能比较有限-Seeking the AOE network critical path of the source code input only limited digital functions
Platform: |
Size: 1024 |
Author: 胡飞 |
Hits:
Description: 用mfc完成AOE，
1.判断工程是否可行
2.求出工程每个活动的最早开始时间e(i),最迟开始时间l(i)和全工程可以完成的最早时间
3.画出AOE网络和关键路径-Complete with mfc AOE, 1. Determine engineering feasibility 2. Obtain engineering earliest start time for each activity e (i), latest start time l (i) and the whole project can be completed the earliest time 3. Draw AOE network and critical path
Platform: |
Size: 11264 |
Author: 黄愫芸 |
Hits: