Depth-First Search - Algorithm, Spanning Trees and Examples

Video 1 of 3 presenting Section 5.3 Depth-First Search from Discrete Mathematics 5th ed by Dossey et al. Here, the depth-first search algorithm is used to find spanning trees of graphs. Two different spanning trees are found using this method, for the same graph. Some terminology related to finding spanning trees using the depth-first search algorithm is also presented.