In our previous videos of our Graph series we covered breadth first traversals, how to implement a graph and various strategies for graph interview questions.
In this video we explore another strategy to traverse a graph using depth first search (DFS). Here we will provide a conceptual breakdown of DFS, how to implement a DFS for graphs using javascript, dive into the Big O complexity analysis and walkthrough sample interview problems.
1:15 Overview
7:20 Code implementation
24:00 Big O Complexity Analysis
25:36 When to use DFS
29:17 Interview question walkthrough
46:42 Recap
If you need a refresher on Graphs, check out our first video of this series here: https://youtu.be/e4RezPkq3UI
