Consider the following graph

Apply breadth-first-search-traversal on the above graph. Which traversal is possible if the start vertex is G? (Assume lexicographic ordering of the adjacency lists).



1. GAHJIBCEKD
2. GAHJIBCDEK
3. GAHIJBDEKC
4. GAHIJBCEKD
5. None of the above

Original Idea by: Sadeeq Olalekan Bello




Comments

  1. Joao MeidanisMarch 25, 2023 at 7:20 AM

    Interesting question, but we have a few like that already. Also, please add 'Original idea by: ' and your name at the end. Also, don't forget the alternative E. None of the above. When you say 'lexicographic ordering', are you referring to the adjacency lists? Please be clearer.

    ReplyDelete

Post a Comment

Popular posts from this blog

In an evolving network following the Barabási-Albert model, there are two nodes - node C with a degree of 15, and node D with a degree of 25. Given the preferential attachment characteristic of the model, how much more likely is a new node to connect to D than to C? A. 0.6 times more likely B. 1.6 times more likely C. 2.5 times more likely D. 1.7 times more likely E. None of the above Original idea by: Olalekan Sadeeq Bello
Read more
Image
   Which set of edges represents a minimum cut in this network? A. Edges s-A, s-C, and E-t B. Edges A-B, D-E, and E-t C. Edges s-A, C-D, and E-t D. Edges B-t, D-E, and E-t E. None of the above Original idea by: Sadeeq Olalekan Bello
Read more