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: (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: 介绍求关键路经的算法，对于给出的事件结点网络，要求求出从起点到终点的所有路径，经分析、比较后找出长读最大的路径，从而得出求关键路径的算法，并给出计算机上机实现的源程序。 -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网的应用这一主题，用图形化的界面实现了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:
Search - algorithm of aoe network