Depth First Search Explained - Algorithm, Examples, and Code
Offered By: Reducible via YouTube
Course Description
Overview
Dive into the world of graph algorithms with this comprehensive video tutorial on Depth First Search (DFS). Explore the fundamental concepts of graph traversal before delving into detailed examples that provide intuition for DFS. Learn both recursive and iterative implementations, complete with code demonstrations. Understand the distinctions between preorder and postorder DFS traversals. Discover practical and engaging applications of DFS in graph theory. Follow along with time-stamped sections covering introduction, graph traversal basics, DFS walkthroughs, implementation techniques, traversal order comparisons, and real-world applications. Enhance your understanding of this crucial algorithm through clear explanations and visual animations created using the open-source manim library.
Syllabus
Intro and Preview
Graph Traversal
DFS Walkthrough and Examples
Recursive Implementation
Iterative Implementation
Preorder vs Postorder DFS
DFS Applications
Taught by
Reducible
Related Courses
Aplicaciones de la teoría de grafos a la vida realMiríadax Aplicaciones de la Teoría de Grafos a la vida real
Universitat Politècnica de València via UPV [X] Introduction to Computational Thinking and Data Science
Massachusetts Institute of Technology via edX Genome Sequencing (Bioinformatics II)
University of California, San Diego via Coursera Algorithmic Information Dynamics: From Networks to Cells
Santa Fe Institute via Complexity Explorer