313 views
0 votes
0 votes

Consider the following graph. If BFS is implemented on the following graph where the root node is 1 then which of the following set of the nodes are present in the queue after performing 4th enqueue operation?

  • 3, 4, 5

  • 4, 6, 5

  • 3, 4

  • 4, 5, 6

Please log in or register to answer this question.

Related questions

2 votes
2 votes
0 answers
1
gari asked Jan 11, 2018
633 views
what is the question asking exactly?
1 votes
1 votes
1 answer
3
0 votes
0 votes
0 answers
4
Tuhin Dutta asked Dec 12, 2017
370 views
Starting vertex is : $V_1$Find the BFS traversal sequence