计算机工程与应用 ›› 2011, Vol. 47 ›› Issue (28): 45-47.

• 研究、探讨 • 上一篇    下一篇

k元组合的Hamiltonan回路快速搜索算法

潘荷新1,伊崇信2,李 满2   

  1. 1.常州纺织服装职业技术学院 信息技术系,江苏 常州 213164
    2.山东华宇职业技术学院 计算机系,山东 德州 253034
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2011-10-01 发布日期:2011-10-01

Quick search algorithm for all Hamiltonian cycles based on k-combination

PAN Hexin1,YI Chongxin2,LI Man2   

  1. 1.Department of Informaition Technology,Changzhou Textile Garment Institute,Changzhou,Jiangsu 213164,China
    2.Department of Computer,Shandong Huayu Vocational College,Dezhou,Shandong 253034,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2011-10-01 Published:2011-10-01

摘要: 通过定义k元组合的方式给出了一个逐步搜索图(有向或元向)的全部Hamiltonan回路的新算法和判定图的哈密顿特性的充要条件。使用该算法可准确地求出Hamiltonan图的全部Hamiltonan回路,不必生成基本回路。

关键词: k元组合, 图, Hamiltonan回路

Abstract: It presents a novel algorithm increasingly searching all Hamiltonian cycles in a directed or undirected graph and the necessary and sufficient condition for Hamiltonian characteristics based on the definition of k-combination.The algorithm can discover all Hamiltonian cycles,where the basic cycles are not generated.

Key words: k-combination, graph, Hamiltonian cycle