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