根据关键路径法和串行调度原理，论述了先序活动和后序活动时间参数计算的方法，并以实例阐述了计算原理。
According to critical path method and serial scheduling, a schema was discussed for computing time parameters of transitive predecessors and transitive successors.
结果表明，所提出的模型既能正确、直观地表达工程计划问题，又能形式化描述、计算工程计划关键路径问题。
The conclusion is drawn that FTPN can not only be used to express the project planning properly and clearly, but also give a formal representation and computation easily.
通过加权关键路径算法，可以计算工作流完成时间的期望值及记录约简过程中的中间结果，从而确定工作流模型的关键路径。
A weighted critical path algorithm was provided to calculate the expectation value of the workflow's duration, record the process of reduction, and identify the time-oriented critical path.
同时利用截集区间网络关键路径与模糊网络关键度的关系，计算出所有路径的关键度。
At the same time, compute all the path criticalities by utilizing the relationship between the critical path of interval networks and the path criticality of the fuzzy network as well.
用前面讲过的算法，我们可以计算从这个关键点到下一个关键点最快的弧线路径。
Using the algorithm described in the preceding section, we can calculate the fastest curved path to get from the current waypoint to the next waypoint.
有效的路径查询处理是地理信息系统、导航系统及计算机网络等高级应用中的一个关键需求。
Efficient path query processing is a key requirement for advanced applications including GIS (Geographic Information systems), navigation systems, and computer networks.
有效的路径查询处理是地理信息系统、导航系统及计算机网络等高级应用中的一个关键需求。
Efficient path query processing is a key requirement for advanced applications including GIS (Geographic Information systems), navigation systems, and computer networks.
应用推荐