G Gate Ranker @gateranker18 added a Question 30 Aug 2017 Find the sum of BFS and DFS traversals of a graph of 5 nodes. 2Comments thumbs up down up0 like shivani @shivani1234 30 Aug 2017 01:49 pm I don't get your question what do u mean by sum of bfs and dfs traversals , is it no. of ways of traversal or what? up0 like Log in or register to post comments Habib Mohammad Khan @habibkhan 30 Aug 2017 03:36 pm It should be sum of no of BFS and DFS traversals instead..In a complete graph it will be n! + n! = 2n! for Kn graph..Hence the answer will be 240 here.. up2 liked Log in or register to post comments

I don't get your question what do u mean by sum of bfs and dfs traversals , is it no. of ways of traversal or what?

It should be sum of no of BFS and DFS traversals instead..In a complete graph it will be n! + n! = 2n! for Kn graph..

.Hence the answer will be 240 here.