Consider an undirected un-weighted graph G. Let a breadth first traversal of G…
RSSB Computer Instructor · Senior Computer Instructor · Paper 2 · 2022
Consider an undirected un-weighted graph G. Let a breadth first traversal of G be done starting from a node r. Let d(r,u) and d(r,v) be the length of the shortest path from r to u and v respectively in G. If u is visited before v during the breadth first traversal, which of the following statement is correct?
- A.
d(r,u) < d(r,v)
- B.
d(r,u) > d(r,v)
- C.
d(r,u) ≤ d(r,v)
- D.
None of the above
Attempted by 655 students.
Sign up free to check your answer
Sign up freeLoading lesson…