本文论述了设计工程进度计划网络图自动生成器的一个关键性工作,即如何让计算机自动将网络各项活动的紧前紧后关系转换成以邻接矩阵或节点对形式表示的网络。文中针对网络活动逻辑关系的计算机表示、网络活动逻辑关系的数字化处理、初步形成网络的简化等作了较为详细的讨论。 This paper discusses the key task of designing an automatic schedule generator network plan generator, which is how to make the computer automatically convert the immediate close-relationship of each activity in the network into a network represented by the adjacency matrix or node pairs. In this paper, a detailed discussion is made on the computer representation of the logical relationship of network activities, the digital processing of the logical relationship of network activities and the simplification of the initial network formation.