0 votes 0 votes Is there any graph whose number of BFS and DFS traversals are different?If so which graph. Programming in C breadth-first-search data-structures + – AIkiran01 asked Aug 5, 2018 AIkiran01 659 views answer comment Share Follow See all 13 Comments See all 13 13 Comments reply Show 10 previous comments srestha commented Aug 5, 2018 reply Follow Share is it? I read in iitD lecture it goes to maximum depth 0 votes 0 votes Shaik Masthan commented Aug 5, 2018 reply Follow Share In some cases we visit maximum depth, example complete graph... But it's not needed for every case 0 votes 0 votes srestha commented Aug 5, 2018 reply Follow Share Any example u got where it is told, it is not going max depth, only required depth? I think u may correct, Still no reference but if u take subgraph in case of DFS then how No.of traversal BFS and DFS orders are equal. is correct? 0 votes 0 votes Please log in or register to add a comment.
