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

Abstract: 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.

Key words: activity network graphs, object-oriented, critical path algorithm, coding