Computer Science, asked by sairohith7995, 4 months ago

Suppose we obtain the following BFS tree rooted at node J for an undirected graph with vertices A,B,C,D,E,F,G,H,1,J,K.Which of the following
cannot be an edge in the original graph?
Options
CG
B,k
BE
AD​

Answers

Answered by Anonymous
0

Answer:

B,k

Explanation:

the correct answer is B,k

Similar questions