1 votes 1 votes 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. Algorithms algorithms graph-algorithms true-false + – dileswar sahu asked Sep 2, 2017 • retagged Jul 6, 2022 by Lakshman Bhaiya dileswar sahu 2.2k views answer comment Share Follow See 1 comment See all 1 1 comment reply Manu Thakur commented Sep 3, 2017 reply Follow Share this statement seems to be true to me. 0 votes 0 votes Please log in or register to add a comment.
2 votes 2 votes 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. kapilthukral94 answered Sep 12, 2018 kapilthukral94 comment Share Follow See all 2 Comments See all 2 2 Comments reply Ram Swaroop commented Dec 26, 2019 reply Follow Share 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 0 votes 0 votes shashankrustagi commented Jan 25, 2021 reply Follow Share Thanks sir. Thanks for acadflix group. Shashank here 0 votes 0 votes Please log in or register to add a comment.