Discrete Math II - 11.4.2 Spanning Trees - Breadth 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 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: bellevueuniversity-my.sharepo...
The entire playlist can be found here: • Discrete Math II/Combi...

[@denver6346]

Hello, for the exmaple at 3:21 , is it wrong if i connect e to d instead of f?

[@AbdulHadi-wt5hm]

No, I think it would still be correct

[@charlesbacon8441]

at 45 secs shouldn't it be b,d and e shown as connected to a ? as d is level 1

[@muhammadubaidullah3739]

If it will be connected to d too it doesn't fulfill the criteria of inorder traversal,but in b it's happening.

[@lucystar5921]

​@@muhammadubaidullah3739 but then based of in order travercal logic e should also be under b?

[@davethesid8960]

​@@muhammadubaidullah3739 No, edge AD should've been drawn in because it's also distance 1 away from A.