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

Periodic Table
PatrickNoonan
Geometry Formulas
Selam H
Unit 1 Sociology: Family Types
ArcticCourtney
OCR Biology AS level (f211) flashcards/revision notes
Dariush Zarrabi
GCSE Revision: Christianity
Andrea Leyden
Chemistry Module C1: Air Quality
James McConnell
A-level English Language Power & Gender Theories
Libby Shaw
GCSE CHEMISTRY UNIT 2 STRUCTURE AND BONDING
mustafizk
GCSE AQA Biology 2 Enzymes, Digestion & Enzyme Uses
Lilac Potato
AQA GCSE Chemistry Unit 2
Gabi Germain
2PR101 1.test - 7. část
Nikola Truong
Browse Library