Breadth First Search (BFS): Visualized and Explained

preview_player
Показать описание
In this video we break down the BFS algorithm in a visual manner with examples and key intuition. We then show the implementation of the algorithm with code and then finish off the video by demonstrating how you can use the BFS algorithm to solve the Flood Fill problem.

0:00 Introduction
0:45 BFS Intuition/Examples
2:39 BFS Implementation
5:19 Flood Fill Problem

Music:

All other music by Aakash Gandhi
Рекомендации по теме
Комментарии
Автор

Hey everyone, quick channel update: this channel recently hit 1K subscribers! Thank you all for your support and kind comments on all my videos. I got a lot of ideas for interesting content in future videos so stay tuned (hit that subscribe button)! As always, thanks for watching!

Reducible
Автор

Love the 3blue1brown vibes. This is the best way to learn for me and you do a great job explaining everything.

masonbiddle
Автор

This is amazing content! I'm a high school student who loves computer science, and this is just amazing. I know a lot of effort must have gone into these videos (what with having to learn manim and everything), I hope you continue into the future

maxwellhunt
Автор

Another highly polished video. You deserve so much more subscribers (sickening to see only 1k subscribers for such high quaility content). You are 3Blue1Brown
of computer science for me and hopefully you get millions of subscribers like him.

jarmanbrar
Автор

I must say, this is one of the most effectively explained videos for DS & Alogs. Even though video is around 10.40 minutes, it's well ordered, planed and well explained to the point. Recommend this channel to anybody, who is looking for a quick but more elaborated explanations on Data Structures and Algorithms.

udaraabeyrathne
Автор

Your graph theory series is amazing, I wish there was more to this series with more advanced topics! only thing I would like to point out is that you can mark vertexes as visited right after pushing them to stack/queue, Because you can be certain that if a vertex is in the stack/queue it is waiting to be visited, this avoids unnecessary insert/remove operations on stack/queue.

wlockuz
Автор

The work you are doing here is fantastic, hope all the best for you man, thanks a lot

thenriquevicentini
Автор

I wish if you were my DSA lecturer, just came across you channel I wish if i knew your channel a year ago. Keep making these high standard videos. Would love to see a whole series about Data Structures and Algorithms.

hamzakhalid
Автор

I finally understand BFS!! THANK YOU SO MUCH. That ball and string intuition piece made my mouth drop. And I finally truly understand a flooding algorithm - how why and when to use it. THANK YOU!!

xaceffulgent
Автор

this is amazing, thank you for making them. These videos are timeless, people will be coming back to them in 2 years

yixe
Автор

Love these videos! Really interesting topics and they’re super easy to follow

jamesmcgreivy
Автор

BEST CODING VIDEO I HAVE EVER WATCHED! So elegantly explained, thanks so much!!! 🙏🏻

aaroncroft
Автор

Such well organized content and finely polished presentation. Instantly subscribed. Appreciate the effort!

liuculiu
Автор

@2:39
So so so so so so so helpful to actually have a visualized explanation of the implementation of the codes!!
Thank you so much!! You are absolutely brilliant :)

kyoungjunhan
Автор

Absolutely stunning! Love the animations and the intuitive vibe just like 3b1b;

mayankmudgal
Автор

The flood fill problem is a great example for the use of graph traversal algorithms! Definitly going to show it to my students.

rtcwtwister
Автор

I really do appreciate your graph theory videos they are really clear and I love the way you are making me think about the problems and solutions. Please make more videos about graph theory and maybe showing some examples of problems solved with graph theory

VladyYakovenko
Автор

Thankyou so much for this video!! This is awesome. Today my DS teacher gave me the same problem and voila! I got you.Thanks✌🏼, You cleared my confusion!

mandelbrot
Автор

Amazing Content Sir, like no one else in Computer Science Domain. Really Appreciate you animation, background music and hardwork you put in every video❤️😁❤️

orion
Автор

Just want to say this is a fantastic explanation!! I am taking cs50ai and the first problem is the use BFS to find the shortest path between two actors and I just solved it thanks to this video

shanehowe