| 求团之间最优路径的扩展双向广度搜索算法的改进 |
| |
| 引用本文： | 许光汉.求团之间最优路径的扩展双向广度搜索算法的改进[J].北京航空航天大学学报,1995(2). |
| |
| 作者姓名： | 许光汉 |
| |
| 作者单位： | 北京航空航天大学计算机科学与工程系 |
| |
| 摘 要： | 对求团之间最优路径的扩展扩度深度混合搜索算法进行了改进，将原算法中扩展双向广度搜索的三个过程合并为一个过程．改进算法当路径深度较小时与原算法等效，当路径深度较大时有更高的运行效率．
|
| 关 键 词： | 双边搜索，计算方法，集团（数学），交通运输管理，连通图，最优路径 |
AN IMPROVEMENT FOR THE EXTENDED-TWO-WAY-WIDTH SEARCH ALGORITHM OF OPTIMUM PATH BETWEEN CLIQUES |
| |
| Xu Guanghan.AN IMPROVEMENT FOR THE EXTENDED-TWO-WAY-WIDTH SEARCH ALGORITHM OF OPTIMUM PATH BETWEEN CLIQUES[J].Journal of Beijing University of Aeronautics and Astronautics,1995(2). |
| |
| Authors: | Xu Guanghan |
| |
| Abstract: | The extended-width-depth mixed search algorithm of optimum path between cliques is improved. Three procedures of extended-two-way-width search in the original algorithm are merged into one procedure. The improved algorithm is equivalent to the original algorithm when the depth of path is less. and has higher running efficienly when the depth of path is bigger. |
| |
| Keywords: | two-side search computational methods clique (mathematics) traffic management connected graphs optimum path |
| 本文献已被 CNKI 等数据库收录！ |
