| 对提高有向图全路径穷举算法效率的研究 |
| |
| 引用本文： | 王春明,高红云,刘晓琳. 对提高有向图全路径穷举算法效率的研究[J]. 包钢科技, 2010, 36(4): 40-42. DOI: 10.3969/j.issn.1009-5438.2010.04.014 |
| |
| 作者姓名： | 王春明 高红云 刘晓琳 |
| |
| 作者单位： | 内蒙古科技大学信息工程学院,内蒙古,包头,014010;内蒙古包钢钢联股份有限公司运输部,内蒙古,包头,014010;内蒙古科技大学信息工程学院,内蒙古,包头,014010;内蒙古包钢钢联股份有限公司技术中心,内蒙古,包头,014010 |
| |
| 摘 要： | 文章对复杂有向图全路径穷举问题的算法与算法效率作了较为详尽的研究和分析,提出了提高效率的办法,并提出了一种新的簇集搜索算法,同时对新算法的时间复杂度进行了分析计算,为更高效的算法研究提供了理论依据。
|
| 关 键 词： | 有向图 全路径穷举 簇集搜索 时间复杂度 |
Study on Improving Efficiencies of Algorithm for Exhaustion with Full Path in Directed Graph |
| |
| WANG Chun-ming,GAO Hong-yun,LIU Xiao-lin. Study on Improving Efficiencies of Algorithm for Exhaustion with Full Path in Directed Graph[J]. Science & Technology of Baotou Steel(Group) Corporation, 2010, 36(4): 40-42. DOI: 10.3969/j.issn.1009-5438.2010.04.014 |
| |
| Authors: | WANG Chun-ming GAO Hong-yun LIU Xiao-lin |
| |
| Affiliation: | WANG Chun-ming1,2,GAO Hong-yun1,LIU Xiao-lin3(1.School of Information Engineering,Inner Mongolia University of Science and Technology,Baotou 014010,Nei Monggol,China;2.Transportation Dept.of Steel Union Co.Ltd.of Baotou Steel(Group)Corp.,Baotou 014010,Nei Monggol,China;3.Technical Center of Steel Union Co.Ltd.of Baotou Steel(Group) Corp.,Baotou 014010,Nei Monggol,China) |
| |
| Abstract: | In the paper,it is studied and analysed the algorithms for complex exhaustive problems with full path in directed graph,and their efficiencies in detail.Moreover,ways to improve the efficiencies and a new cluster search algorithm are proposed.The time complexity of the algorithm is analyzed and calculated,which provides theoretical basis for more efficient algorithms. |
| |
| Keywords: | directed graph full path exhaustion cluster search time complexity |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
