5 Let Graph G Connected Combine Dfs Bfs Following Way Start Vertex U Find Neighbor V Refer Q37234571

5. Let Graph G be connected. Combine DFS and BFS in the following way: Start at a vertex, u, find a neighbor, v, that refers the minimum weight on the edge that links these two vertices. Then move to the new vertex (v) and put this edge in a bucket When you reach the vertex that is visited you will return to the entering vertex, and so on. If you have visited all

OR

 

OR