0 votes 0 votes closed as a duplicate of: GATE CSE 2003 | Question: 21 How to count the number of different DFS possible? For given question https://www.google.com/amp/s/www.geeksforgeeks.org/gate-gate-cs-2003-question-21/amp/ vg653 asked Dec 28, 2018 closed Dec 28, 2018 by Shaik Masthan vg653 530 views comment Share Follow See all 4 Comments See all 4 4 Comments reply Shaik Masthan commented Dec 28, 2018 reply Follow Share @vg653 all previous GATE questions are already solved in this Platform, https://gateoverflow.in/previous-years 0 votes 0 votes vg653 commented Dec 28, 2018 reply Follow Share @Shaik Masthan Sir, I am not asking the same question. . I am asking a different question for the same graph!! My Question is- Is it possible to count the number of different DFS/BFS for the given graph? 0 votes 0 votes Shaik Masthan commented Dec 28, 2018 reply Follow Share there is no specific shortcut to find it, by observing the question you have to apply some logic on it ! But as per my knowledge, they will ask on directed graph but not on undirected graph ( it's my opinion ) in case of directed graph, this approach may help you ! https://gateoverflow.in/253496/number-of-topological-order?show=253499#c253499 https://gateoverflow.in/237432/topological-ordering-and-dfs ( check all the questions to understand it clearly ! ) 0 votes 0 votes vg653 commented Dec 28, 2018 reply Follow Share Okay Sir!! Thank You! ! 0 votes 0 votes Please log in or register to add a comment.