True/False?

Question

The depth of any DFS (Depth First Search) tree rooted at a vertex is at least as much as the depth of any BFS tree rooted at the same vertex.

I think in line graph has the same depth in both DFS and BFS. So it may be false.

Comments

this statement seems to be true to me.

Answer 1

The statement is true.

statement says depth of dfs tree  is greater than or EQUAL to depth of bfs tree.

Line graph is the example where depth of dfs tree and deptih of bfs tree are same.

Comments

Except line graph depth of dfs always greater than depth of the bfs

Best way to take small example solve your own it becomes easy

---

Thanks sir. Thanks for acadflix group. Shashank here