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 Programming in C data-structures graph-algorithms + – Sahil_Lather asked Jan 28, 2023 Sahil_Lather 313 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.