Depth-first Search (DFS) on Graphs Part 1 - Algorithm
This video tutorial shows how the depth-first search (DFS) algorithm can be used to traverse a graph, using various examples of directed and undirected graphs. After the algorithm is explained in detail, the running time is derived. This tutorial is part of a series on Data Structures and Algorithms, by Sesh Venugopal.