Question

Breadth-First search traversal. 100% Upvote/Thumbs up. Thank you in advance

QUESTION 20 Consider an undirected, unweighted graph G = (V,E) with V = {1,2,3,4,5,6) and E = {(1,2),(1,3), (1,4),(2,3),(2,5),(3,5),(4,6).(5,6)}. What is the Breadth-First Search traversal starting at vertex 67 Build your adjacency list in ascending order. List the values separated by spaces.

Answer 1

Given GCUIE) VE 6:4 (1,2), Cla) CH4),(2,3)G5 2,65146)66) let us draw the graph with the given edges. Now Let us find the Breadth first search Traversal, Adjacency list: Null 2 3 2 2 5 mul 3. 6 4 761 rull 6 14 15 ( wn the When ever, there is a tie, break the the as per lists can follow the ascending ordu of vertices

For BFs, we queue. And we traverse breadth wise, you need to traverse all the adjacent nodes 8 selected Veeted, and then thawere one of the adjacent hode, adjacent nodes need to be traversed. 6 © enquies Ć 64 6 enqreuen 16/415 's enquen c?y now since s don't have adjacent vertices, deque 6, adjacent edges of 4, i el and add u enqueuil

unrisited vertices, so dequest them among (1) Similarly, 4 don't have add adjacent vertices of 5 1.6 (2,3) Choose 2 first O 5/12 enque 2 ire. 3. Now add other adjacut edge ogs All vectices visited, so deque one by one All of these 1 (BFS) The order is: 6,4,5, 1,2,3 (for simples representation of geaph.

please please upvote... and comment for doubts