Algoritmo de Búsqueda en Profundidad o Depth First Search (DFS) para grafos | Explicación detallada

In today's video, I'm going to explain how the Depth First Search (DFS) algorithm works. This algorithm is vital in graph theory and helps us traverse or search tree or graph data structures. More information about this algorithm: https://es.wikipedia.org/wiki/B%C3%BA... If you have any questions, leave a comment and I'll help you as much as I can! Contact/Business: [email protected] Additional information, schematics, and more on my blog: https://eltallerdetd.wordpress.com/ The best Arduino projects on the channel: https://goo.gl/mCKknp The best programming projects on the channel: https://www.youtube.com/playlist?list... My social media → @eltallerdetd / @tadeodonegana Video index: 00:00 Introduction 00:12 What is the Depth First Search algorithm? 00:35 Complete playlist on Graph Theory in Computer Science 00:49 Vertices and Edges of the graph to be analyzed 1:05 Vertex notation (Undiscovered, Discovered, and Visited) 1:51 Step-by-step example of how the DFS algorithm works 6:07 DFS algorithm code 6:34 Final thoughts and farewell "Neutrin05 - Home" is under a Creative Commons (CC-BY 3.0) license Music promoted by BreakingCopyright: https://bit.ly/bkc-home