术语，关键路径图 Critical Path Mapping, 在网络图中路径最长的路径。也表明在其中一个步骤推延，输出地整个时间将增加。
对邻接矩阵在图的遍历、最小生成树、拓扑排序和关键路径等算法分析上的应用作了一定的探讨。
This paper discusses the application of adjacency matrix at the algorithm's analysis for traversing Graph, Minimum cost Spanning Tree, Topological sort and Critical Path.
通过定义节点编码图概念，提出一种不需要拓扑排序的求解关键路径的新算法。
A new algorithm for finding the critical paths is proposed by using coding graph and without topological sort.
这种算法的关键是选择相干图来标识相位数据的可靠性，相位展开的路径由相干图导向。
The key of the algorithm is to point out the dependability of data by choosing coherence maps.
应用推荐