基于宽度优先搜索的路径生成算法  

Search Path Building Algorithm based on Breadth-First Search

作　　者：卢启衡[1] 冯晓红[2] 

机构地区：[1]西南交通大学电气工程学院 [2]西南交通大学软件学院,成都610031

出　　处：《现代计算机》2006年第12期87-89,共3页Modern Computer

摘　　要：宽度优先搜索和深度优先搜索是图论中常用的两种搜索算法。两者各有优势,但深度优先搜索算法的效率在低连通度图中会大大降低,这时更适合采用宽度优先搜索算法。本文提出了一种基于宽度优先搜索的路径生成算法,具有较好的时间复杂性和空间复杂性。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.

关 键 词：宽度优先搜索 深度优先搜索 搜索路径 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]