摘要
讨论了图搜索的非启发式和启发式算法，着重分析了它们各自的复杂性、优缺点及其相互关系，提出了改进要点．这对于如何选用一个合适的搜索算法是十分有益的．
The graph search algorithms of heuristic and nonheuristic are discussed.Their complexity, their own advantages and shortcomings are emphasized.Some improved points are put forward,which are helpful to select a proper search algorithm.
出处
《西南民族学院学报（自然科学版）》
1998年第2期117-122,共6页
Journal of Southwest Nationalities College(Natural Science Edition)
