DFS Algorithm | Depth First Search Algorithm for Graph Search With Animated Example

This video will cover the DFS algorithm, which is a shortcut for depth first search. This is one of the core graph algorithms in Computer Science. DFS is used in other important graph problems, such as finding strongly connected components in a graph, finding a topological sort in a graph and more, so having a good understanding of how DFS works will serve you well when exploring more advanced topics in this domain.
The video will review a recursive solution for DFS and its time and space complexity.
The algorithm assumes the graph is represented using adjacency lists. If you'd like to learn more about adjacency lists, here is a link to a video that covers this topic - https://www.youtube.com/watch?v=EQsZJCsNOSc&ab_channel=CSBoard
To make the algorithm clear, we will go over an extensive animated example of a DFS run.
Then, we will learn about few interesting properties of DFS, specifically we'll talk about the predecessor graph, the parentheses property and classification of edges.
Then we will see a non-recursive version of DFS algorithm.

0:00 Introduction and Intuition Example
1:40 DFS Algorithm Pseudocode (Recursive)
4:24 Time Complexity
5:56 Space Complexity
6:29 DFS Run Example
15:33 DFS Predecessor Graph
16:28 The Parentheses Property
17:26 DFS Edges Classification
19:41 DFS Algorithm Pseudocode (Non-Recursive)
21:31 What's Next? DFS Applications