Location:
Search - 关键路径
Search list
Description: 关键路径39 ok VC- Essential way 39 ok VC
Platform: |
Size: 2201 |
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: 一些数据结构算法的例子，包括哈夫曼编码、图的表示、关键路径、最短路径等-Some examples of data structure algorithms, including Huffman coding, map, said the critical path, the shortest path, etc.
Platform: |
Size: 7168 |
Author: 站长 |
Hits:
Description: 关键路径39 ok VC- Essential way 39 ok VC
Platform: |
Size: 2048 |
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: 用C语言实现数据结构的几种常用结构，还包括关键路径的程序。-C language data structures Several structures, including Critical Path procedures.
Platform: |
Size: 32768 |
Author: 曾文 |
Hits:
Description: 实现了关键路径算法。 给定一些点，并给定点间的路径的权值，求两点间的最短路径-achieve a critical path algorithm. Given some point and fixed-point to the right path of duty between 2:00 seek the shortest path
Platform: |
Size: 2048 |
Author: 罗春威 |
Hits:
Description: 数据结构中实现图的关键路径的算法，是在TC中运行的。-data structure to achieve the critical path map algorithm is run in the TC.
Platform: |
Size: 1024 |
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: 本设计完成了要求的所有功能，可由系统建立一张图或者由用户自行建立一张图,并对该图进行关键路径的搜寻.用户界面友好，有用户使用说明,每一步操作都有说明与提示。程序运行通过，有详细的解释说明。-the design completed all the required functions, from the establishment of a system or plan established by the users themselves a map, and this map critical path of the search. User friendly interface, users note, every step of the operation have notes and hints. Running through a detailed explanation.
Platform: |
Size: 3072 |
Author: 妮娜 |
Hits:
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:
Description: c语言实现关键路径。预先设定图，可输入权值，希望能满足一些人需要-Critical Path. The pre-set plan, the right value to be imported, hoping to meet some people who need
Platform: |
Size: 25600 |
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: 数据结构中关键路径算法的实现与应用。介绍求关键路经的算法，对于给出的事件结点网络，要求求出从起点到终点的所有路径，经分析、比较后找出长读最大的路径，从而得出求关键路径的算法。-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: 1 归并链表
2 静态链表
3 堆栈
4 KMP模式匹配
5 排序
6 关键路径-a static Chain Chain 2 3 4 stack KMP Ranking 6 5 Critical Path
Platform: |
Size: 102400 |
Author: 丘方 |
Hits:
Description: 用java写的可以计算一张图中的关键路径的程序 速度还可以-written with java can calculate a map of the critical path of procedures can also speed
Platform: |
Size: 10194944 |
Author: 陈减肥 |
Hits:
Description: 拓扑排序主要是为了解决一个工程能否顺利进行的问题，但有时我们还需要解决工程完成所需要的最短时间问题。我们如果对一个流程图获得最短时间，就需要分析它们的拓扑关系，并且找到当中的最关键流程，这个流程的时间就是最短时间。(Topological sorting is mainly to solve the problem of whether a project can be carried out smoothly, but sometimes we need to solve the shortest time problem needed for the completion of the project. If we get the shortest time for a flow chart, we need to analyze their topological relationships and find the most critical process, which is the shortest time.)
Platform: |
Size: 324608 |
Author: 飞洒吧year
|
Hits:
« 12
3
4
5
6
7
8
9
10
...
15
»