Discrete Math II - 11.4.1 Spanning Trees - Depth-First Search

We continue our study of trees by examining spanning trees. Spanning trees are subgraphs of a graph that contain all vertices of the original graph. The resulting subgraph is a tree, so the graph is connected and contains no cycles.
In our first methodology, we will use a depth-first search. That means that we will begin creating our spanning tree by choosing a specific vertex starting point, then follow that path until we can no longer reach any unvisited vertices. We will then backtrack through the vertices to visit any remaining unvisited vertices.
Video Chapters:
Intro 0:00
What is a Spanning Tree 0:11
Depth-First Search/Backtracking Method 1:15
Using a Stack 4:00
Practice 6:42
Up Next 8:27
This playlist uses Discrete Mathematics and Its Applications, Rosen 8e Power Point slide decks to accompany the videos can be found here: bellevueuniversity-my.sharepo...
The entire playlist can be found here: • Discrete Math II/Combi...

[@magnusfjeldstad2506]

Well explained video thank you very much!

[@shazminmariam1867]

Thank you for this video

[@Victor-tl4dk]

Thanks for your help!

[@SawFinMath]

Thanks for the super thanks! ❤️

[@gegeinthehouse]

Thanks so much

[@arunays9859]

you missed vertex 'j' in the practice question.

[@charlesbacon8441]

isn't f incident to a?

[@tino_]

yes it is, i believe you just add it to the stack above C, and when you visit it you just remove it