| 基于宽度优先搜索的路径生成算法 |
| |
| 引用本文： | 卢启衡,冯晓红.基于宽度优先搜索的路径生成算法[J].现代计算机,2006(12):87-89. |
| |
| 作者姓名： | 卢启衡 冯晓红 |
| |
| 作者单位： | [1]西南交通大学电气工程学院,成都610031 [2]西南交通大学软件学院,成都610031 [3]成都铁路运输学校,成都610081 |
| |
| 摘 要： | 宽度优先搜索和深度优先搜索是图论中常用的两种搜索算法.两者各有优势,但深度优先搜索算法的效率在低连通度图中会大大降低,这时更适合采用宽度优先搜索算法.本文提出了一种基于宽度优先搜索的路径生成算法,具有较好的时间复杂性和空间复杂性.
|
| 关 键 词： | 宽度优先搜索 深度优先搜索 搜索路径 |
| 收稿时间： | 2006-10-12 |
| 修稿时间： | 2006-10-12 |
Search Path Building Algorithm based on Breadth-First Search |
| |
| LU Qi-heng,FENG Xiao-hong.Search Path Building Algorithm based on Breadth-First Search[J].Modem Computer,2006(12):87-89. |
| |
| Authors: | LU Qi-heng FENG Xiao-hong |
| |
| Affiliation: | 1. Electric Engineering College in Southwest Jiaotong University, Chengdu 610031 China; 2. Software Engineering College in Southwest Jiaotong University, Chengdu 610031 China; 3. Chengdu Railway Transportation School, Chengdu 610081 China |
| |
| Abstract: | Breadth-first search and Depth-first search are two often used search algorithms. The two algorithms have their own advantages. The efficiency of Depth-first search algorithm will decrease greatly in the case of low connectivity, so it is better to use Breadth-first search algorithm at that time. This article gives an algorithm of building search path, which has a more efficient space and time complexity. |
| |
| Keywords: | Breadth-First Search Depth-First Search Search Path |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
