The definition of a digraph is Given, Directed graph is obtained from this starting point to the other longest path between any vertex of the algorithm. Without prejudice to the conditions of the longest path, through the analysis of changes in the edge of mobile resources, a directed graph of this sensitivity analysis method to solve this kind of directed graphs in the application process optimization analysis problems is given.%给出了一种有向图的定义.得到了这种有向图从始点到其它任一顶点之间最长路的算法.在不影响整个最长路的条件下,通过边上机动资源变化的分析,给出了这种有向图灵敏度分析的方法.解决了这种有向图在应用过程中的优化分析问题.
展开▼
