Copy and Edit

Breadth First Search (BFS) Tutorial - InterviewBit

Description

Detailed Tutorial on Breadth First Search (BFS), an algorithm for traversing or searching layerwise in tree or graph data structures. Check out our curated list of practice problems and interview questions to improve your understanding of the topic.
Sonia Mathias
Slide Set by Sonia Mathias, updated more than 1 year ago
Sonia Mathias
Created by Sonia Mathias about 4 years ago
2
0
0

Resource summary

Slide 1

    Breadth+First+Search (video/mp4)
    Breadth First Search (BFS) is a traversing algorithm where we start at the tree root (or any arbitrary node of a graph called ‘source node’), and investigate all of the neighboring nodes (directly connected to source node) at the present level before moving on to the nodes at the next level. The process is repeated until the desired result is obtained. Check out BFS example to get a better understanding on how this algorithm works.  
    Caption: : BFS Algorithm
Show full summary Hide full summary

Want to create your own Slides for free with GoConqr? Learn more.

Similar

Market failure and government intervention - Definitions
clm3496
KING LEAR
Felicity Baines
Newton's Three Laws of Motion
*Anna*
Notes - Managing change in human environments
chrislmurray2014
Computing
Ben Leader
Speed, Distance, Time
Bradley Sansom
AS AQA Geography- Rivers
Hannah Goodenough
Freud's Theory of Personality
09andreonei
Sociology Unit 2: Education
PSYCHGIRL
Mathematics A - Edexcel - GCSE - Paper 1 November 2014 1MA0/1H Theory
Josh Anderson
Tips for Succeeding on the Day of the Exam
Jonathan Moore
Browse Library