Description: 数据结构中关键路径算法的实现与应用。介绍求关键路经的算法，对于给出的事件结点网络，要求求出从起点到终点的所有路径，经分析、比较后找出长读最大的路径，从而得出求关键路径的算法。-data structure Critical Path algorithm implementation and application. Introduced for passing key algorithm is given for the incident node network requirements derived from the start-to-end path of all, the analysis and comparison to identify a long time after the path, thereby reaching critical path for the algorithm. Platform: |
Size: 4584 |
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: 31466 |
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: 该程序能实现的功能，若活动图有回路则无法计算出关键路径，即解决了判断工程的可行性问题。通过对工程活动的输入，可以建立任意的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: 运行程序后！由于为了测试方便，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: (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: 数据结构中关键路径算法的实现与应用。介绍求关键路经的算法，对于给出的事件结点网络，要求求出从起点到终点的所有路径，经分析、比较后找出长读最大的路径，从而得出求关键路径的算法。-data structure Critical Path algorithm implementation and application. Introduced for passing key algorithm is given for the incident node network requirements derived from the start-to-end path of all, the analysis and comparison to identify a long time after the path, thereby reaching critical path for the algorithm. Platform: |
Size: 4096 |
Author:周善人 |
Hits:
Description: 利用Visual c++编程思想方法实现基于交通网络关键路径算法-The use of Visual c++ Programming way of thinking based on the critical path algorithm for traffic network Platform: |
Size: 10044416 |
Author:caoyang |
Hits:
Description: 读取网络图！寻找网络图的关键路线！另外会附上解决网络问题的代码！-Read network! Find the critical path network diagram! Another solution to network issues will be attached to the code! Platform: |
Size: 3072 |
Author:sam |
Hits:
Description: 对于给出的结点网络求关键路径的算法，用c语言编写的！-Give the node for the network critical path for the algorithm, with c languages! Platform: |
Size: 19456 |
Author:winky |
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: 拓扑排序：对给定的AOV网判断网中是否存在环，检测的办法是对有向图构造其顶点的拓扑有序序列，若网中所有顶点都在它的拓扑有序序列中，则该AOV网中必定不存在环。在拓扑排序的基础上实现关键路径的的求解。-Topological Sort: AOV of a given network to determine the existence of ring network to detect the approach is the directed graph topological structure of its vertices in an orderly sequence, if all vertex network topology in its orderly sequence, the AOV network does not exist is bound to ring. In the topological sort on the basis of solving the critical path. Platform: |
Size: 243712 |
Author:feixue_12 |
Hits:
Description: 关键路径算法，对给定的网络结构，用关键路径算法可以给出具体的找到必须要走的路径-Critical Path, on a given network structure, with the critical path algorithm can be found given a specific path that must be taken Platform: |
Size: 1024 |
Author:张晓东 |
Hits:
Description: 适用于Microsoft Project 的VBA，对于给定网络图计算关键路径-For Microsoft Project, VBA, the calculation of critical path for a given network diagram Platform: |
Size: 1024 |
Author:zd |
Hits:
Description: 求解某项工程计划的AOE网的关键路径。输入数据建立AOE网络，计算每一个事件的Ve和Vl，每一个活动的e和l，求出该项工程的所有关键活动和非关键活动，进而求得关键路径。-Solving the critical path of a project AOE network. Input data setup AOE network, compute Ve and Vl every event, every event e and l, find all the key activities and non-critical activities of the project, and then obtain the critical path. Platform: |
Size: 3072 |
Author:陈凤群 |
Hits:
Description: 适用于Microsoft Project 的VBA，对于给定网络图计算关键路径-For Microsoft Project, VBA, the calculation of critical path for a given network diagram Platform: |
Size: 1024 |
Author:zhaao37j307 |
Hits:
Search - critical path network