一种扩展的单代号网络图绘制算法研究  

Research on Plotting Algorithm of Extended Activity-on-node Network Diagram

作　　者：邹海[1] 方强[1] 邱慧丽[1] 

机构地区：[1]安徽大学计算机科学与技术学院,安徽合肥230601

出　　处：《计算机与现代化》2013年第7期169-171,共3页Computer and Modernization

基　　金：国家科技重大专项基金资助项目(2009ZX05039-004)

摘　　要：在工序较多时,单代号网络图难以清晰地表示出工序间的层次结构关系。通过在单代号网络图中引入摘要工序(或节点)以及对引入后节点行、列坐标计算和节点间箭线绘制问题的研究,提出一种扩展的单代号网络图的绘制算法。该算法生成的网络图既能够较好地体现出工序间的层次结构关系,又可方便地利用摘要工序的叠起与展开,使得生成的网络图具有结构简洁和逻辑关系清楚等优点,较好地解决了在工序较多情况下传统单代号网络图所存在的问题。The hierarchical structure of the relationship between activities in the activity-on-node（AON） network diagram is difficult to be clearly displayed when there are more activities.Hence,the traditional AON network diagram is extended by introducing the scope activities（or nodes） to solve this problem.Problems of nodes’locating and arrows line plotting between nodes in the extended network diagram are studied and an algorithm is proposed to plot network diagram.The network diagram drawn according to this algorithm can clearly show the hierarchical relationships of activities.Meanwhile,it is of simple structure and clear logical relationships by folding and expanding the scope activities.

关 键 词：单代号网络图 网络计划 摘要工序 逻辑关系 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]