This paper put forward a simplified method that can be used on activity on node network and activity on line network to identify the critical path of schedule.
提出了一种简化的确定关键路径方法，该方法可分别运用于单代号和双代号网络图中。
This method USES intermediate nodes' location information to create undirected graph at destination node, and USES Breath-First Search (BFS) algorithm to find another disjoint path.
本文提出的方法在目的端利用获得的中间节点位置信息来生成无向图，再利用广度优先遍历算法BFS计算出另外一条不相交路径。
The paper proposes one method of distribution network reconfiguration based on shortest path algorithm and minimum node voltage algorithm.
提出了一种基于最短路算法和最小节点电压法的配电网络重构方法。
This paper introduces a new method of determining the critical path of the network chart-node slack method.
介绍了一种确定网络图关键线路的新方法——结点时差法。
This paper introduces a new method of determining the critical path of the network chart-node slack method.
介绍了一种确定网络图关键线路的新方法——结点时差法。
应用推荐