ScholarLens Back to search
2006•Modern ComputerRequires access

Search Path Building Algorithm based on Breadth-First Search

LU Qi-heng

Open publisher page 2 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Computer science, Best-first search, Depth-first search, Beam stack search, Search algorithm, Bidirectional search, Iterative deepening depth-first search, Breadth-first search

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Search Path Building Algorithm based on Breadth-First Search — Research Paper | ScholarLens