Summary
Full Transcript
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 second methodology, we will use a breadth-first search. That means that we will begin creating our spanning tree by choosing a specific vertex starting point, then connect ALL vertices adjacent to our starting vertex. Then, in order, we will connect each vertex adjacent to all those found in our first level, and so on, until all unvisited vertices have been visited. Video Chapters: Intro 0:00 Breadth-First Search 0:06 Practice With Me 2:12 Practice On Your Own 3:25 Up Next 4:41 This playlist uses Discrete Mathematics and Its Applications, Rosen 8e Power Point slide decks to accompany the videos can be found here: https://bellevueuniversity-my.sharepoint.com/:f:/g/personal/kbrehm_bellevue_edu/Ei9DcmrOBTlAuMxWUoq9ZqsB14M60jcpob-xdAYS6ruVWw?e=uP9KN0 The entire playlist can be found here: https://www.youtube.com/playlist?list=PLl-gb0E4MII0sGLCJeqDB3y63HZ6lM5LJ
Continue this lesson in the app
Install CourseHive on Android or iOS to keep learning while you move.
