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 over 3 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

Developmental Psychology - Freud, Little Hans (1909)
Robyn Chamberlain
AP Chemistry
Cathal Darby
Biology AQA 3.1.2 Proteins
evie.daines
CPA Exam Topics and breakdown
joemontin
A Christmas Carol Quotes
0serenityrose0
Circle Theorems
I Turner
Input Devices
Jess Peason
Biology B2.3
Jade Allatt
Biology B1
Kelsey Phillips
English Basic Grammar
tvazacconcia
Legislative Branch
Mr. Vakhovsky
Browse Library