retagged by
651 views
3 votes
3 votes

retagged by

2 Answers

Best answer
6 votes
6 votes
Graph is connected ..from each node we can go to every other nodes..

A graph with 5 nodes given so if we do DFS traversal it will consist all 5 nodes ..so number of DFS traversals possible 5!

if we apply same logic then  number of BFS traversals possible 5! ways .

Then the total number of ways = 5! + 5! = 120 + 120 = 240
selected by
0 votes
0 votes
I am getting 240 as the answer..but i am not sure whether it is correct or not.
Answer:

Related questions