面向对象技术实现活动网络图及关键路径算法  

Realizations of activity network graphs and critical path algorithm based on objectoriented technique

作　　者：张静文[1] 周杉[1] 

机构地区：[1]西北工业大学管理学院,西安710072

出　　处：《计算机工程与应用》2016年第4期234-237,共4页Computer Engineering and Applications

基　　金：陕西省自然科学基金(No.2015JM7368);陕西省社会科学基金(No.2014P23);西北工业大学管理振兴基金(No.RW201309);西北工业大学研究生创意创新种子基金(No.Z2015162)

摘　　要：采用邻接矩阵表示项目活动网络图需要较多的存储空间,且基于结构化程序设计思想实现网络图和关键路径算法都非常繁琐。采用面向对象的类表示活动,基于动态数组表示活动网络图及活动之间的逻辑关系,并据此开发了基于面向对象技术实现关键路径算法的代码,进一步从理论上分析了采用面向对象技术的优势。研究表明,相对于传统的处理方式,基于面向对象技术的项目活动网络图表示及关键路径的算法较大降低了存储和计算的复杂性。The expression of adjacency matrixes for graphs of project activity networks requires more storage space,and it is very complicated to realize network graphs and critical path algorithm based on structured programmingthoughts.This paper adopts an object-oriented（OO,in short）class to represent activities,and dynamic arrays to denote activity network graphs and logical precedence relationships among activities;accordingly,the codes of the critical path algorithm are developed by means of an OO technique. Moreover,the advantages of the OO technique are analyzed in theory. The conclusion shows that the representation of activity network graphs and realization of the critical path algorithm based on the OO technique can greatly reduce the complexity of storages and calculations when comparing with the traditional approaches.

关 键 词：活动网络图 面向对象 关键路径算法 编码 

分 类 号：TP399[自动化与计算机技术—计算机应用技术]