Depth First Search Algorithm | Graph Theory

Depth First Search (DFS) algorithm explanation

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

Source code:
https://github.com/williamfiset/algorithms

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

I'm looking for volunteers to review early access versions of my video content pre-recording. If this is something that may interest you please join the following mailing list for further updates:
https://groups.google.com/forum/#!forum/williamfiset-youtube/join

===============================================================================
Developer tools I used in the creation/testing of the content in these videos:

1) Sublime text, my favorite lightweight code editor (https://www.sublimetext.com).
NOTE: I'm often asked about the color scheme I use, find it here: https://github.com/williamfiset/dotfiles/tree/master/sublime

2) Kite, a free AI-powered coding assistant that provides smart code completions while typing:
https://www.kite.com/get-kite/?utm_medium=referral&utm_source=youtube&utm_campaign=williamfiset&utm_content=description-only
===============================================================================

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?

Видео Depth First Search Algorithm | Graph Theory канала WilliamFiset