搜索资源列表
gfloyd
- 本源程序为matlab文件，实现最小生成树和关键路径的查找。-the source document for Matlab and achieve minimum spanning tree and find the critical path.
AOE
- 采用数据结构中的AOE方法对图的关键路径进行计算，此算法摘录了课本中的算法-using the data structure to map AOE method of calculation of critical path, this algorithm extracts from the books of Algorithm
guanjian
- c语言实现关键路径。预先设定图，可输入权值，希望能满足一些人需要-Critical Path. The pre-set plan, the right value to be imported, hoping to meet some people who need
AOE
- 该算法用于分析AOE网络,求出AOE网络的关键路径.-The algorithm used to analyze the AOE network, the network obtained AOE Critical Path.
KeyPath
- 数据结构中关键路径算法的实现与应用。介绍求关键路经的算法，对于给出的事件结点网络，要求求出从起点到终点的所有路径，经分析、比较后找出长读最大的路径，从而得出求关键路径的算法。-data structure Critical Path algorithm implementation and application. Introduced for passing key algorithm is given for the incident node network requirements de
Some_DataStruct_Arithmetic_Implement_by_C
- 1 归并链表 2 静态链表 3 堆栈 4 KMP模式匹配 5 排序 6 关键路径-a static Chain Chain 2 3 4 stack KMP Ranking 6 5 Critical Path
mypro3final
- 用java写的可以计算一张图中的关键路径的程序 速度还可以-written with java can calculate a map of the critical path of procedures can also speed
critiall_path_java
- 寻找关键路径的程序，用java实现-Find Critical Path program that will achieve java.
guanjianlujing
- 关键路径完美版,用VC++6.0实现,用WIN TC也行,不过要修改头文件-perfect version of Critical Path, VC 6.0, with WIN TC also, but the first document to be amended
PRAGH_caq
- 一个工程的图算法小程序，用于计算工期，关键路径的-one of the plan algorithm small program used to calculate the time limit, critical path
keyway
- 有关关键路径的算法源代码，里边有相应的注释-the critical path algorithm source code, along with the corresponding Notes
tuopu
- 经典的拓扑排序算法，对数据结构的关键路径，最短路径的学习有很大的帮助！-classic topological sorting algorithm, the data structure of the critical path, the shortest path in their study of great help!
key_path
- AOE图工程工期控制问题，求解工程的工期与关键路径-AOE plans to control the construction period, the time limit for the project and the critical path
path
- 这个是我们大学的一个小学期作业，是完成关键路径的搜索-this is our university a primary period of operation is the completion of the Critical Path Search
关键路径算法
- 运行程序后！由于为了测试方便，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.
zb
- 用C语言实现数据结构的几种常用结构，还包括关键路径的程序。-C language data structures Several structures, including Critical Path procedures.
critical_path
- 实现了关键路径算法。 给定一些点，并给定点间的路径的权值，求两点间的最短路径-achieve a critical path algorithm. Given some point and fixed-point to the right path of duty between 2:00 seek the shortest path
关键路径
- (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(
path
- 使用C++编写的数据结构中的图的关键路径。-The use of C++ to prepare the data structure in the critical path diagram.
Critical-path-problem-
- 关键路径问题，用二叉树的方法去实现如何和查找关键的路途，帮助你怎样选择最佳路径。-Critical path problem, the binary tree method to achieve and how to find the key to the road, to help you how to choose the best path.