Search the World's Largest Database of Information Science & Technology Terms & Definitions
InfInfoScipedia LogoScipedia
A Free Service of IGI Global Publishing House
Below please find a list of definitions for the term that
you selected from multiple scholarly research resources.

What is Breadth First Search

Encyclopedia of Business Analytics and Optimization
A graph search algorithm which tries all one-step extensions of current paths before trying larger extensions. This requires all current paths to be kept in memory simultaneously or at least their end points.
Published in Chapter:
RIP Technique for Frequent Itemset Mining
Shorya Agrawal (GLA University, Mathura, U.P., India)
Copyright: © 2014 |Pages: 10
DOI: 10.4018/978-1-4666-5202-6.ch186
Full Text Chapter Download: US $37.50 Add to Cart
More Results
Evaluating Top-k Skyline Queries on R-Trees
Its acronym is BFS. It is an algorithm that searches elements traversing a graph by levels.
Full Text Chapter Download: US $37.50 Add to Cart
eContent Pro Discount Banner
InfoSci OnDemandECP Editorial ServicesAGOSR