Depth First Search (DFS) Explained: Algorithm, Examples, and Code
In this video, I explain the fundamental ideas behind the Depth First Search (DFS) graph algorithm. We first introduce the concept of a graph traversal. We then go through several examples of DFS to provide intuition. Afterwards, we then go through both a recursive and iterative implementation with provided code. We discuss the differences between the implementation and also make a distinction between a preorder and post order DFS traversal. We then finish the video off with some practical and fun applications of depth first search in graph theory.
0:00 Intro and Preview
0:50 Graph Traversal
1:20 DFS Walkthrough and Examples
6:26 Recursive Implementation
11:08 Iterative Implementation
15:06 Preorder vs Postorder DFS
17:01 DFS Applications
Support: / reducible
This video wouldn't be possible without the open source manim library created by 3blue1brown: https://github.com/3b1b/manim
Here is link to the repository that contains the code used to generate the animations in this video: https://github.com/nipunramk/Reducible
On this page of the site you can watch the video online Depth First Search (DFS) Explained: Algorithm, Examples, and Code with a duration of hours minute second in good quality, which was uploaded by the user Reducible 05 July 2020, share the link with friends and acquaintances, this video has already been watched 390,738 times on youtube and it was liked by 12 thousand viewers. Enjoy your viewing!
