Depth First Search (DFS) Algorithm in Graph Theory

Depth First Search (DFS) algorithm explanation

Source code:
https://github.com/williamfiset/algorithms#graph-theory

Video Slides:
https://github.com/williamfiset/Algorithms/tree/master/slides/graphtheory

0:00 Depth first search as an algorithm template
1:04 Simple DFS example
3:30 Depth first search pseudocode
5:10 Finding connected components with a DFS
7:32 connected components source code
9:27 What else is a DFS useful for?

===================================

Practicing for interviews? I have used, and recommend `Cracking the Coding Interview` which got me a job at Google. Link on Amazon: https://amzn.to/3cvMof5

A lot of the content on this channel is inspired by the book `Competitive Programming` by Steven Halim which I frequently use as a resource and reference. Link on Amazon: https://amzn.to/3wC2nix

Support me by purchasing the full graph theory course on Udemy which includes additional problems, exercises and quizzes not available on YouTube:
https://www.udemy.com/course/graph-theory-algorithms