This is how I explore caves in Minecraft.

@abhishek.rathore

3 жыл бұрын

I had the exact same idea. Lol ;)

@zuhairmehdee

3 жыл бұрын

This is a surprisingly intuitive comparison. Thanks a lot. +

@ElektrykFlaaj

3 жыл бұрын

except caves in minecraft often have no dead end

@abhishek.rathore

3 жыл бұрын

@@ElektrykFlaaj yeah and they often loop back too

@ironlegnebula

3 жыл бұрын

+1 best system, would recommend

The thing I love most about great channels using manim, is that i never feel like im watching a 3B1B rip-off, just an intelligent explanation of a topic. Keep up the amazing videos

This is the best video on this! I love this channel, it is going to become really popular! Thank you! Love the animations. And the design.

@Reducible

3 жыл бұрын

Thanks for the kind comment!

By the way, a very interesting point is that you can convert any recursive function into a stack + while len(stack) > 0 loop because basically that's exactly how computers do that on a low level anyway. In some languages it has some advantages, because while function call stack may be limited, a stack as a structure is practically unlimited, and that lets us achieve very deep levels of recursion without stumbling into stack overflow.

@thefamousdjx

7 ай бұрын

Wow thanks this made me dig deeper and understand even better.

great video! I'll also point out (as a few others have hinted) that the iterative approach is very important for large graphs. Default stack sizes on modern OS' are still typically quite small, and it's easy to construct pathological graphs which will cause a stack overflow with a recursive DFS implementation. Using an explicit (and heap-allocated) stack as in the iterative approach works around this (until the machine runs out of memory, of course!), and is a crucial reason why this approach is often chosen.

@marioivanovivanov4248

Жыл бұрын

Hi can u please tell me more about this? For example how is it possibile to construct a "pathological" graph. i'm assuming that a pathological graph is a graph whose nodes are linked in such a way that when the DFS algorithm is called on the graph, it goes into an infinite recursive loop that overflows the stack.

The video is great, as always. However, I have a suggestion: maybe at the end of the video, you can ask some graph questions and let us think how to slove, and finally, you can give the java or python code and the step of it. (just like your recursion video because your recursion video is absolutely amazing.)

@Reducible

4 жыл бұрын

Thank for the feedback, will try to incorporate more problems in future videos.

One thing that I love about this channel is that, because the quality is so huge, all the comments will start praising the video but also adding new information and providing constructive feedback. I think that people feel compelled to give some retribution after watching such a great video for free.

i can feel your effort man, the planning, research, animation, music.. I'm glad i came across this channel.... you gonna get huge success..

The presentation of how to use a stack and pop together was really interesting. I always had trouble with while loops, this pattern makes it so apparent when it is best used.

Your content is incredibly good. It's not only comprehensive and to the point, but also enjoyable. Thank you for all the effort you are putting in.

Well structured, easy to follow, beautiful graphics, use of video chapters and real world use cases included. What can I expect more? Superb video.

I love 3B1B videos and now these are my favorite too. Thanks for all the effort and excellent explanations!

Thank you for making DFS and BFS understandable. Simple and on point

absolutely the best explanation on DFS that I have encountered. Please make more videos on graph theory and algorithms.

The best CS channel to understand graphs hands down! THANK YOU Reducible!! You are just awesome!

I really love your explanation, it's short, concise, easy to understand, straight to the point. I watched many another's videos, they were lengthy and hard to understand.

You deserve so many more subs. This content is so well explained. Fantastic channel!

This was a great video, explaining not only DFS, but both recursive and iterative versions of it, and presenting applications for DFS, all accompanied by illustrations to make it even more clear. Cant thank you enough!

This is the best way to explain recursive functions to newbies like me. Thank you so much for such great contents.

looking forward to BFS too! Thank you for posting!

Great Content Man and that Recursion video is Awsome . Keep Making more videos.

probably the best explanation of DFS I have ever come across! thank you! :)

Best video so far I found on DFS algorithm. Very clear explanation. Thank you very much!

I'm proud for being among the first 1000 subs while I know this channel will explode subs count to millions very soon

@ejejej9200

3 жыл бұрын

Me too! This channel is going to be huge!

@curbyourshi1056

3 жыл бұрын

It's absolutely happening. Pleased to be part of the blow up.

These videos are gold. They go into much more depth than their peers, with expanded intuition, alternatives, and application. Well done sir! P.S. the animation is also top notch.

Brilliant video. Those animations really helped to understand the whole process. Thanks!

Your videos make the difficult concepts so easy to grasp!

So happy I found this channel and this video! It was really, really helpful.

Amazing video I have already done my bachelors in CS and have seen various videos explaining various Algos but your approach is simple, intuitive and precise among all others please keep it up!

I couldn't help myself but comment how beautifully the content has been delivered..... Kudos to u guys, love and appreciation from India🤘🤘

This is Gold! Just one video and I think I'm done understanding graphs. Thanks a lot!

@thamidurandilbandara415

Жыл бұрын

there is a lot more, but yes the video explained it very well

Thank you for the amazing video. This is the most understandable explanation I've ever seen. Visualization, narration and music is very good:)

Great video, great teaching, and great animation used here to make things understandable by going into a deeper level of abstraction of all the steps and processes. Before this video, I watched 4-5 videos on DFS that appeared on top after searching and had more views (even in millions) but couldn't understand them clearly. After all, this is the ultimate video that quenched my thirst. Thank you sir for your great content. This channel should grow more and more fast.

Simple and Clear:) Thanks for the amazing videos!

This is the first time I'm posting a comment for a video, simply because I don't really bother to. But this is something. This is that good! Sooooo good! Concise and yet complete. Simply brilliant!

JUST WAITING FOR THIS WONDERFUL WONDERFUL GEM OF A CHANNEL TO EXPLODE. THANKYOU THIS IS AMZING

2:22 is an example of the classic Cycle Detection algorithm where DFS is used to detect any cycle in a graph G. Child node 2 has a "back-edge" that connects it with the root node 0. This is basically a cycle in the graph.

Brilliantly explained, so simple and clear. You gained a new subscriber!

It's really amazing... your contents and way of explanation everything is awesome... keep it up...

great animations, video, and i love the last part where u mentioned the applications

Amazing!!! Please do this for all concepts of DSA. You are a rare gem!!!

Thanks for that soft music in background, really helped boosting focus while watching this video. Great explanation as well. Thank you.

The way we designed the animation and the calmness of your voice in the time of explanation and the depth of your discussion just blow my mind. May Almighty Bless You💝

I really love your format, great work, subbed right away

Loved your amazing explanation, thank you!

What an incredible video, thank you for the content, really well explained! 😁

Okay, I'm 5 minutes in but I had to comment. This is, hands down, the best explanation of DFS I've ever encountered. Thank you so much for this phenomenal video - I hope you keep it up!

thank you so much for the amazing explanation and such great animations!

this is probably the best explaination ive came across

Best video ever. Helped me understand the DFS better.

you do great job. you deserve more appreciation, and you will have it.

Perfect explanation. It is may 5th video and just understood everything thanks to you. Great.

You get a new suscriber! Amazing videos and explanations! Really really very good!

I liked and subscribed. awesome explanation. Good visualization and best animation. Keep the good work.

I wish this videos came earlier.....great content man!

Great Effort there! Appreciate the time you took to fork Manim and manage it so well for all of us. Regarding the algo in preview, at 8:20, where you mention to maintain boolean values of marked nodes, it should be of size/length - G.order() rather G.size(). For a graph, order = number of vertices = |V| while size = number of edges = |E|. This could cause problems if we have a straight line graph with n nodes connected by (n-1) edges!

Finally I found the best channel That's amazing I wish to support you more ...

Brilliant. Nice explanation. Really helpful 👌👏👍

Great video! Thank you so much for it.

Thank you for the clear explanation very easy to follow. You got a new subscriber keep up the good content👍

This is the best video ive ever seen in my life

Best Explained !!!!! Thanks from India 🇮🇳!!!!!

This is simply an amazing explanation

Really good explaination!

Amazing explanation. My teacher did the same but you explained it way more easier.

Very good explanation, thank you!

I really love how you explain and the music, I really love this yt channel thank you so much

The best explanation!!This guy is a gem

slick video and great explanation

The king of the hill is here... can't wait to become a patreon this content is 🔥...

Thank you so much!!! Much love from India.

Thanks for great explanation.

I love ur channel 🥺 such a wonderful explanation

wow, what a great explanation! thank you!

great explaining video for Graph Thnaks

You're the man! Perfect explanation!

superb explanation!

So well done! Great job

Your channel is amazing! How you don't have hundreds of thousands of subscribers is beyond me. Please keep up the good work!

@Reducible

3 жыл бұрын

Thank you! Hopefully we get there in the future :)

@sivsivsree

3 жыл бұрын

@@Reducible you will

Beautifully animated video, though forgive me if I don't like this way of introducing DFS. The main problem is that most of the applications could just as well be solved without DFS: Cycle Detection: DFS does not give you all cycles in the way you described, and just determining whether a graph contains cycles can be done by BFS or similar also. Finding Connected Components: Any Traversal technique will do nicely. Topological Sort: Take Kahn's algorithm. The idea there is your reasoning at 18:37, but translated more directly into an algorithm. Maze: There are several ways to create a maze, but granted this one is elegant :) This sometimes leaves students wondering whether DFS is just a bad alternative to BFS for the path finding problem. It is not! Of course some applications are harder to explain in a video, but here is a surprisingly useful application somewhat related to your examples: Partitioning a directed graph into strongly connected components (SCCs, Sets of nodes where you can reach every node from every other node). This is useful in e.g. model checking, where you want to proove the correctness of a program, which can be reduces to finding an SCC with a special marking and a loop. Checking whether an SCC has a loop and is marked is usually trivial (loop at least two nodes in the SCC or a reflective edge). Or you might want to replace SCCs with single nodes, yielding a DAG. This e.g. extends many planning algorithms to handle circular dependencies (exactly the SCCs with several nodes). Basic idea without any proofs: Every SCC is represented by the node within it first encountered during DFS. Start by assuming every node is its own SCC and start the DFS. If you keep a hashset of all the nodes currently on the stack (or mark nodes as on the stack), you can efficiently determine whether a node was encountered twice along a path. If that happens, you found a loop and can merge all SCCs on the stack from the first encounter to the second. An SCC is guaranteed to no longer grow once DFS leaves it (through the node representing it, which you can detect). At that point, note the SCC down. Side node: Like in your example, the SCCs outputted this way are topologically sorted. Sadly, most students never get to learn these more useful applications of DFS, but hey, thats why I'm writing long comments :) Thanks for reading!

@ron3799

2 жыл бұрын

wait, this is really useful info. thank you for taking the time to write this all !

This seems like a very useful algorithm to know, I feel like I can already see some applications of it

Perfectly done. Thanks

Literally just learned about this in class today and it popped up in my recommendation. KZread algorithm is getting insane.

good animation easy explanation covered a variety of algos in just 20 min. 👍👍👍

great explanation, thanks.

Really amazing video 🙌🙌

Thanks a lot for the explanation!

I rarely comment on KZread but I must say you are the exact version of KZreadr and tutor I am dreaming to be..Before reading the solution and algorithm, we must understand why it was created , what was the intuition behind it... and second thing I loved is bg music..

please continue making these kind of videos . .....!!!!!!

Fantastic video! Kudos!

thnx for this amazing animated visulization.

Incredible video!

very best tutorial , well-done

Awesome video you are a amazing teacher

*Great Content!!!* Understood a lot

very nicely explained thx a lot

Thank u very much , the video helped a lot ❤️

Awesome as always!

greatly explanied!

Great explanation, it would be awesome if you can create similar videos around Trees (diff trees and usages).