Breadth First Search (BFS): Visualized and Explained

[@Reducible]

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!

[@blatanthamma6624]

really good content, would you consider making a video about A* algorithm and topological sort, also maybe some data structure like red/black tree, segment tree, I'd be watching them!

[@kasyapdharanikota8570]

Please make more videos ,really great channel and content

[@wokguysrandomstuff5535]

What? 6 month ago you had only 1k subs? Unbelievable

[@ultramasculine]

please, do more videos. it's much more interestring than reading books

[@susantabasak1327]

We certainly need more videos from you on the topic (GRAPH)

[@masonbiddle6750]

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

[@andrewprahst2529]

Nice profile picture. I do wonder what the software is though

[@Mayank-mf7xr]

He is the 3b1b of Computer Science.

[@saivol6462]

heyyy a 3blue1brown fan.. hard to come by

[@ParthPaTeL-wm3kt]

@@andrewprahst2529 The animation is made through python manim library created by 3b1b

[@jackiezibub5150]

@@andrewprahst2529 if its what 3blue1brown uses its called manim

[@udaraabeyrathne7167]

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.

[@maxwellhunt3732]

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

[@Reducible]

Thanks for the awesome comment! And yeah, these videos do take a lot of time and effort, but it's a lot of fun for me so I plan on continuing for the foreseeable future!

[@AkshatSinghania]

Same , do you do competitive programming too?

[@maxwellhunt3732]

@@AkshatSinghania yep!

[@jarmanbrar4114]

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.

[@xaceffulgent]

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

[@srujanjoshi3780]

The ball and string analogy alone was enough to get me to like the video :D

[@yixe2253]

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

[@Reducible]

Glad you enjoyed it -- thanks for the awesome comment.

[@filipm133]

@@Reducible he was right, great content

[@wlockuz4467]

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.

[@MattCM89]

Hands down best vidoe on youtube for learning this!

[@hamzakhalid4311]

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.

[@hasnat_malik]

your way of teaching is absolutely amazing

[@Reducible]

Glad you enjoyed it!

[@shanehowe2751]

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

[@aaroncroft7514]

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

[@YuuhanngChau]

I love the music, so relieving, make me concentrate on what you are talking about.

[@manupratap6406]

I am addicted to such content. Plz if someone else also creates such content pl tell. Ur videos make maths so beautiful. Hats off👏👏

[@rtcwtwister]

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

[@kyoungjunhan1098]

@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 :)

[@mandelbrot3162]

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!

[@sivsivsree]

This channel is a gold mine!

[@fredericoamigo]

I’m such a fan of your work! I’d give this a million likes if I could. You are definitely making the world a better place! Keep up the great work! I truly appreciate it!

[@thequantartist]

The quality of this channel is incredible. 3blue1brown level.

[@okta25]

"Imagine you are pulling the ball up until all the strings tightened" simply Genius !

[@rubamushtaq1657]

This problem seems like a building block to solve graph problems. Thank you for sharing this.

[@thenriquevicentini]

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

[@Jbdoster]

Oh yeah This is definitely the one It’s been years since my undergrad and this helped me review thank you so much

[@arekysa]

This channel is so much underrated

[@matiaslast2100]

this is awesome man! it has a clear explanation with pseudocode easy enough to understand and make an implementation thanks!!

[@lefuturiste27]

lol that was python, great to do pseudocode I guess

[@ahmedouerfelli4709]

You deserve much more subscribers.

[@AshishKumar-xx3dx]

Again an awesome explanation by Reducible

[@kobic8]

amazing!!! helped me a lot, as a junior that is just introduced to this topic

[@alex19991014]

Excellent explanation and example. Love it when you mention the real life example of the “Fill” button in Paint🎨 app, it gave me a instant picture of BFS.

[@emre5740]

That's a great efford! I wish I discovered this channel earlier. Thanks

[@VladyYakovenko]

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

[@navneet5084]

I might have been traversing the internet the DFS way, that's why I found your channel so late!

[@orion2843]

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

[@liuculiu8366]

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

[@mayankmudgal1728]

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

[@monickverma2944]

this is the best. i beg u not to stop

[@jamesmcgreivy2882]

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

[@ParthVerma-kc1wr]

This was so insanely good! Although I watched the video a few times. I could understand everything!!

[@henrroo]

Your explanation was so good, thank you very much, keep doing these kind of videos bro!

[@vikasviki7490]

Awesome Content, Please add more such videos, Graph and DP would be Awesome.

[@dnm9931]

Beautiful and clear explanation! Thank you so much!

[@sufalt123]

flood fill problem reminded me about strongly connected components on graphs

[@yatharthmishra01]

Beautifully explained ! Keep up the good work.

[@alexbrodbelt297]

This is incredible, I cannot thank you enough!

[@dipankarkumarsingh]

Please please please keep uploading videos ... they are soooooooo good .....

[@daemitrious]

For those not very adept with Python, it may be difficult to understand your 'neighbors' implementation at 9:40. I know you probably wanted to keep everything in one slide, but it may have been better to expand the list comprehension in 'neighbors' so that it's more verbose and easier to read. Other than that, this video was fantastic and the color scheme you used was awesome thank you for the hard work.

[@user-wc1sm8cj8s]

really great contents, I really understand a lot from your videos! *Keep it up*

[@robtito2009]

You guys deserve so much more subscribers

[@marioprado8789]

That level explanation. Awesome!

[@AdityaMoza]

Absolutely amazing. Please make as many videos as you possibly can on graph theory. I'd buy a complete DSA course from you if you choose to make one.

[@erv993]

Wow, that's a very cool explanation! I think I understand it much better now, thx!

[@SomebodyYouUsedToSee]

Bro , You are just tooooooooooooo good , please make more algorithm videos

[@lastshots300]

absolutely loving your content - great stuff

[@mohdrasid6737]

such a clear and detailed explanation 👏. Thank you 😇

[@essamgouda1609]

KZbin is indeed full of gems.

[@1mr12]

that was eazy, simple, adorable !

[@SamTablet-z9t]

thanks for clear explaining

[@Lolwutdesu9000]

This is an awesome video, but your neighbours function is flawed. You don't need to verify whether it connects to start. Think about it ;)

[@yeah5037]

Very nice video, thank you!

[@hasnat_malik]

man i'm new to the channel and am lovin it

[@Speykious]

I just watched this video after I intuitively found by myself an algorithm to capture a group of stones in a GO game setup

[@petesantago5977]

Excellent content - thank you.

[@zhougood8998]

it helps me a lot!!!

[@saymatasnim5912]

Really can't thank you enough!

[@rodrigomarchi9755]

Great video!

[@huseinjavidmehr1228]

was fluent explanation thank you

[@carljustinemosquida4727]

hope more graphs algos in the future

[@BerArchegas]

Amazing vid, amazing channel

[@KumarDinesh-zw2vq]

Wow man. Love you

[@Saleh-le2zf]

I still love you man!

[@brendawilliams8062]

Thankyou.

[@kautilyap9856]

Can you please develop a course comprising on data structures, algorithms and problem solving paradigms??

[@Reducible]

Or ... I could just make a course equivalent series of videos on KZbin for free :P

[@kautilyap9856]

@@Reducible Yeah you can! That would be the best thing! But like can you do them simultaneously and in one video

[@mohamedmoumni8916]

great Job , Thanks A lot.

[@tedarcher9120]

If you code in Python, never initialise a list as [something]*N, because it will create a list with N the same objects, which will break your program. Instead, use [False for _ in range(N)]

[@brendawilliams8062]

When you have shoe laces and need to tie them

[@marco_gallone]

I recognize that the only difference in the two algorithms (BFS vs DFS) is that BFS uses a queue vs DFS uses a stack. But you presented a really clean algorithm using recursion in DFS. Can BFS be reduced down to a recursive form too?

[@Reducible]

Well, it's always possible, but it really doesn't make sense to use recursion since DFS recursion is just using the call stack. Recursion implicitly uses a stack. BFS uses a queue which is basically the opposite of the stack so it really doesn't fit the recursive framework. See this for a more thorough discussion and some of the possible ways: stackoverflow.com/questions/2549541/performing-breadth-first-search-recursively

[@godwinwabz5379]

Hello.... Thanks for creating your content.. however, I realized that in your animation, while visiting vertex 3, you added 2 to the queue. However, 2 is adjacent to vertex 0, therefore, it would be visited at the same level with vertices 1, and 3. Therefore, adding it into the queue would result into revisiting of the vertex, which isn't efficient

[@nihao852]

legend

[@nontth5355]

i wish i watch this video before I build my minesweeper game if so I wouldn’t have a hard time figuring out flood fill on my own btw I think the isValid function can be write like this def isValid(img, row, col): return row in range(len(img)) and col in range(len(img[0])

[@ullaskunder]

Perfect

[@andrewprahst2529]

I'm just here because I really like lines and stuff

[@joinrevolution]

OMG how did I find myself here? I was looking for funny dog videos

[@TheStylestatement]

Best one

[@riyadh5449]

Wow, how lovely you accent is😇.. damn to Hindi accent!

[@michaelheuss6502]

It's been a long time since I took algorithms, but I think we skipped BFS in general and went straight to Dijkstra's algorithm.

[@rhaq426]

cool intro

[@ananyapamde4514]

Gold

[@stevenperez5260]

I was wondering to know what software did you use for the graph animations?

[@Battler-tbb]

B - Boss F - Fighting S - Stages

[@handlebred]

very good vide;)

[@justinrush6620]

Curious why you didn't just use a min/max function with neighbors to avoid boundary issues? Wouldn't that be a simpler implementation?

[@Memes_I_Stole_For_A_Living]

Is it possible to change queue = [(row, col] to queue = start?

[@jackabrams5859]

thumbnail looks like the reverse transmutation circle from FMAB

[@patriot925th]

around 6:30, you said (row, col): (2,2). but it seems like (3,3). what am I missing here?

[@davidequattrocchi5083]

I've been using variants of this algorithm for years. I never thought I had invented it first... but knowing it for sure is still somewhat disappointing.

[@nurhusni]

Is this channel related to 3blue1brown?

[@Reducible]

Directly, no. I love his work and I think his channel is one of the best educational channels out there. I use the same animation library he uses so I guess the content will have a similar style in that sense.

[@asutoshghanto3419]

@@Reducible please can you make a documentation of manim? it is very difficult to work with it . Can you tell how do I label points marked on a 2d graph.

[@gamerkaue88]

Here before 1k views.