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 almost 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

U.S. Naturalization Test
Jaffar Barjan
Economics definitions: F582
busybee112
Causes of the Cold War Quiz
Fro Ninja
GCSE AQA Chemistry Atomic Structure and Bonding
mustafizk
An Inspector Calls - Quotes
jaynejuby
DNA Replication
Laura Badger
Chapter 5: Short-term and Working Memory
krupa8711
RE Keywords - Paper 1 - Religion and life
Kerris Linney
The Circulatory System
Hamza Ahmed
Themes in Othello
Rebecca Hunter
Les Aliments
dAnn dAnn
Browse Library