用最短路径法求关键路线及其SAS的实施

Solve the critical path problem by the shortest path method

利用网络工程的关键路线为耗期最长的特点 ,将其按照一定的规则转化成最短路径问题 ,然后利用求最短路径的 SAS程序 ,顺利地求出网络工程的关键路线 .

The critical path problem is transformed to the shortest path problem according to the time limit for a project being the summation of the critical path.And the critical path problem is solved successfully by the shortest path procedure in software of SAS/OR/netflow.