1 votes 1 votes How to find number of BFS and DFS traversals for any complete graph? I am trying to find a formula for it. Algorithms graph-algorithms + – Krupa Rajani asked Jan 11, 2017 • retagged Jul 6, 2022 by Lakshman Bhaiya Krupa Rajani 1.6k views answer comment Share Follow See 1 comment See all 1 1 comment reply srestha commented Jan 12, 2017 reply Follow Share No formula is there for BFS, DFS I think 0 votes 0 votes Please log in or register to add a comment.
2 votes 2 votes Say no of vertices in the graph = N As per my observation. no of BFS traversal in a complete graph is no of vertices in the graph = factorial( N). no of DFS traversal in a complete graph is no of vertices in the graph = factorial( N) Arnab Bhadra answered Jun 18, 2017 Arnab Bhadra comment Share Follow See 1 comment See all 1 1 comment reply Arnab Bhadra commented Jun 18, 2017 reply Follow Share Correct me if I am wrong. 0 votes 0 votes Please log in or register to add a comment.