您目前所在的位置:首页 - 期刊简介 - 详细页面

铁道科学与工程学报

JOURNAL OF RAILWAY SCIENCE AND ENGINEERING

第11卷    第1期    总第57期    2014年2月

[PDF全文下载]    [Flash在线阅读]

    

文章编号:1672-7029(2014)01-0036-07
基于邻接矩阵的CPM网络图线路枚举算法
王卫东,阳博,王小雪

(中南大学 土木工程学院, 湖南 长沙 410075)

摘 要: 为将邻接矩阵所表达的复杂网络关系转化为一系列简单的单线线路,以线路矩阵进行表达,提出一种枚举网络图线路的算法。该算法以邻接矩阵为数据源,直接针对实工序进行搜索,克服了单代号和双代号网络图中虚工序的影响;算法利用邻接矩阵元素的定量化意义计算出线路总数,结合广度搜索,应用“遇叉承前”思路,搜索线路组成,最终生成线路矩阵。

 

关键字: CPM网络图;线路枚举;邻接矩阵;广度优先搜索

A path enumeration algorithm of CPM networks based on adjacent matrix
WANG Weidong, YANG Bo, WANG Xiaoxue

School of Civil Engineering, Central South University , Changsha 410075,China

Abstract:To resolve the problem of transforming the complex network relationshop expressed by the adjacent matrix to a series of simple linear path, a path enumeration algorithm was proposed through the expression of path matrix. Because of using adjacent matrix as data resource, the algorithm overcomes the reliance on dummy activities in activity-on-node networks and activity-on-arc networks by searching path among the real activities. It makes use of the quantified definition of the adjacent matrix to compute the total number of paths, combines breadth first search with the thought of copying the previous components when it searches another bifurcation of a node to get the elements of each path, and finally generates a path matrix.

 

Key words: CPM networks; path enumeration; adjacent matrix; breadth first search

ISSN 1672-7029
CN 43-1423/U

主管:中华人民共和国教育部 主办:中南大学 中国铁道学会 承办:中南大学
湘ICP备09001153号 版权所有:《铁道科学与工程学报》编辑部
------------------------------------------------------------------------------------------
地 址:湖南省长沙市韶山南路22号 邮编:410075
电 话:0731-82655133,82656174   传真:0731-82655133   电子邮箱:jrse@mail.csu.edu.cn